首页 > 最新文献

Journal of Combinatorial Designs最新文献

英文 中文
Constructions of Optimal Sparse r -Disjunct Matrices via Packings 通过填充构造最优稀疏r -不相交矩阵
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-04-29 DOI: 10.1002/jcd.21986
Liying Yu, Xin Wang, Lijun Ji
<div> <p>Group testing has been widely used in various aspects, and the <span></span><math> <semantics> <mrow> <mrow> <mi>r</mi> </mrow> </mrow> </semantics></math>-disjunct matrix plays a crucial role in group testing. The original purpose of the group testing is to identify a set of at most <span></span><math> <semantics> <mrow> <mrow> <mi>r</mi> </mrow> </mrow> </semantics></math> positive items from a batch of <span></span><math> <semantics> <mrow> <mrow> <mi>M</mi> </mrow> </mrow> </semantics></math> total items using as fewer tests as possible. In many practical applications, each test can include only a limited number of items and each item can participate in a limited number of tests. In this paper, we use the tools from combinatorial design theory to construct optimal 2-disjunct matrices with <span></span><math> <semantics> <mrow> <mrow> <mi>n</mi> </mrow> </mrow> </semantics></math> rows and limited row weight <span></span><math> <semantics> <mrow> <mrow> <mn>3</mn> <mo><</mo> <mi>ρ</mi> <mo>≤</mo> <mrow> <mo>⌊</mo> <mfrac> <mrow> <mi>n</mi> <mo>−</mo> <mn>1</mn> </mrow> <mn>2</mn> </mfrac> <mo>⌋</mo> </mrow> </mrow> </mrow> </semantics></math> and optimal 3-disjunct matrices with <span></span><math> <semantics> <mrow> <mrow> <mi>n</mi> </mrow> </mrow> </semantics></math> rows and limited row weight <span></span><math> <semantics> <mrow> <mrow> <mn>4</mn> <mo><</mo> <mi>ρ</mi>
群检验在各个方面都有广泛的应用,而r -分离矩阵在群检验中起着至关重要的作用。组测试的最初目的是使用尽可能少的测试,从一批总共M个项目中识别最多r个阳性项目。在许多实际应用中,每个测试只能包含有限数量的项目,每个项目只能参与有限数量的测试。本文利用组合设计理论的工具,构造了具有n行、有限行权3 <的最优二断矩阵;ρ≤⌊n−1 2⌋最优的n行、限定行权4 <的三分析矩阵;ρ≤⌊n−1 3⌋,分别。利用已知的图匹配定理,给出了列权值为r + 1≤的r -不相交矩阵的渐近最优上界W≤2r。
{"title":"Constructions of Optimal Sparse \u0000 \u0000 \u0000 \u0000 r\u0000 \u0000 \u0000 -Disjunct Matrices via Packings","authors":"Liying Yu,&nbsp;Xin Wang,&nbsp;Lijun Ji","doi":"10.1002/jcd.21986","DOIUrl":"https://doi.org/10.1002/jcd.21986","url":null,"abstract":"&lt;div&gt;\u0000 \u0000 &lt;p&gt;Group testing has been widely used in various aspects, and the &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-disjunct matrix plays a crucial role in group testing. The original purpose of the group testing is to identify a set of at most &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; positive items from a batch of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;M&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; total items using as fewer tests as possible. In many practical applications, each test can include only a limited number of items and each item can participate in a limited number of tests. In this paper, we use the tools from combinatorial design theory to construct optimal 2-disjunct matrices with &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; rows and limited row weight &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;3&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;&lt;&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;ρ&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≤&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;⌊&lt;/mo&gt;\u0000 \u0000 &lt;mfrac&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;−&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/mfrac&gt;\u0000 \u0000 &lt;mo&gt;⌋&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and optimal 3-disjunct matrices with &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; rows and limited row weight &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;4&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;&lt;&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;ρ&lt;/mi&gt;\u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 8","pages":"287-299"},"PeriodicalIF":0.5,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144256485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Doubly Orthogonal Equi-Squares and Sliced Orthogonal Arrays
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-04-03 DOI: 10.1002/jcd.21982
John Lorch
<div> <p>We introduce doubly orthogonal equi-squares. Using linear algebra over finite fields, we produce large families of mutually <span></span><math> <semantics> <mrow> <mrow> <msup> <mi>q</mi> <mi>s</mi> </msup> </mrow> </mrow> </semantics></math>-doubly orthogonal equi-<span></span><math> <semantics> <mrow> <mrow> <msup> <mi>q</mi> <mrow> <mi>r</mi> <mo>+</mo> <mi>s</mi> </mrow> </msup> </mrow> </mrow> </semantics></math> squares, and show these are of maximal size when <span></span><math> <semantics> <mrow> <mrow> <mi>s</mi> <mo>≤</mo> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </mrow> </semantics></math>. These results specialize to the results of Xu, Haaland, and Qian when <span></span><math> <semantics> <mrow> <mrow> <mi>r</mi> <mo>=</mo> <mi>s</mi> <mo>=</mo> <mn>1</mn> </mrow> </mrow> </semantics></math> and the equi-squares are Sudoku Latin squares of order <span></span><math> <semantics> <mrow> <mrow> <msup> <mi>q</mi> <mn>2</mn> </msup> </mrow> </mrow> </semantics></math>. Further, we show how a collection of mutually <span></span><math> <semantics> <mrow> <mrow> <msup> <mi>q</mi> <mi>s</mi> </msup> </mrow> </mrow> </semantics></math>-doubly orthogonal equi-<span></span><math> <semantics> <mrow> <mrow> <
我们引入双正交等平方。利用有限域上的线性代数,我们得到互qs的大族——双正交的等qr+ s的平方,并证明当s≤r + 1时它们是最大的。这些结果集中于Xu, Haaland,当r = s = 1时,其等方为q阶数独拉丁方阵2 .此外,我们展示了一个相互q - s -双正交相等q - r的集合+ s平方可以用来构造强度为2的正交切片阵列。这些正交阵列在统计设计中有重要的应用。
{"title":"Doubly Orthogonal Equi-Squares and Sliced Orthogonal Arrays","authors":"John Lorch","doi":"10.1002/jcd.21982","DOIUrl":"https://doi.org/10.1002/jcd.21982","url":null,"abstract":"&lt;div&gt;\u0000 \u0000 &lt;p&gt;We introduce doubly orthogonal equi-squares. Using linear algebra over finite fields, we produce large families of mutually &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;q&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;s&lt;/mi&gt;\u0000 &lt;/msup&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-doubly orthogonal equi-&lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;q&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;s&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msup&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; squares, and show these are of maximal size when &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;s&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≤&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. These results specialize to the results of Xu, Haaland, and Qian when &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;=&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;s&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;=&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and the equi-squares are Sudoku Latin squares of order &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;q&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msup&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. Further, we show how a collection of mutually &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;q&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;s&lt;/mi&gt;\u0000 &lt;/msup&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-doubly orthogonal equi-&lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 7","pages":"275-283"},"PeriodicalIF":0.5,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143944394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Terwilliger Algebra of the Group Association Scheme of the Symmetric Group Sym ( 7 ) 关于对称群Sym群关联方案的Terwilliger代数(7)
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-04-03 DOI: 10.1002/jcd.21981
Allen Herman, Roghayeh Maleki, Andriaherimanana Sarobidy Razafimahatratra

Terwilliger algebras are finite-dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance-regular graphs. The Terwilliger algebras of the conjugacy class association schemes of the symmetric groups � � Sym� � (� � n� � ), for � � 3� � � � n� � � � 6, have been studied and completely determined. The case for � � Sym� � (� � 7� � ) is computationally much more difficult and has a potential application to find the size of the largest permutation codes of � � Sym� � (� � 7� � ) with a minimal distance of at least 4. In this paper, the dimension, the Wedderburn decomposition, and the block dimension decomposition of the Terwilliger algebra of the conjugacy class scheme of the group � � Sym� � (� �

Terwilliger代数是有限维半简单代数,由Paul Terwilliger于1992年在关联方案和距离正则图的研究中首次引入。对称群Sym (n)的共轭类关联方案的Terwilliger代数对于3≤n≤6,已经研究并完全确定。Sym(7)的情况在计算上要困难得多,并且有一个潜在的应用程序来查找最大排列代码的大小Sym(7)的最小距离至少为4。在本文中,维数,Wedderburn分解,确定了群Sym(7)的共轭类格式的Terwilliger代数的块维分解。
{"title":"On the Terwilliger Algebra of the Group Association Scheme of the Symmetric Group \u0000 \u0000 \u0000 \u0000 Sym\u0000 \u0000 (\u0000 7\u0000 )","authors":"Allen Herman,&nbsp;Roghayeh Maleki,&nbsp;Andriaherimanana Sarobidy Razafimahatratra","doi":"10.1002/jcd.21981","DOIUrl":"https://doi.org/10.1002/jcd.21981","url":null,"abstract":"<p>Terwilliger algebras are finite-dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance-regular graphs. The Terwilliger algebras of the conjugacy class association schemes of the symmetric groups <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mtext>Sym</mtext>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>n</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>, for <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mn>3</mn>\u0000 \u0000 <mo>≤</mo>\u0000 \u0000 <mi>n</mi>\u0000 \u0000 <mo>≤</mo>\u0000 \u0000 <mn>6</mn>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>, have been studied and completely determined. The case for <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mtext>Sym</mtext>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mn>7</mn>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> is computationally much more difficult and has a potential application to find the size of the largest permutation codes of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mtext>Sym</mtext>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mn>7</mn>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> with a minimal distance of at least 4. In this paper, the dimension, the Wedderburn decomposition, and the block dimension decomposition of the Terwilliger algebra of the conjugacy class scheme of the group <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mtext>Sym</mtext>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 7","pages":"261-274"},"PeriodicalIF":0.5,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21981","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143944393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Directed Oberwolfach Problem With Variable Cycle Lengths: A Recursive Construction 变周期长的有向Oberwolfach问题:一个递归构造
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-24 DOI: 10.1002/jcd.21967
Suzan Kadri, Mateja Šajna
<p>The directed Oberwolfach problem <span></span><math> <semantics> <mrow> <mrow> <msup> <mstyle> <mspace></mspace> <mtext>OP</mtext> <mspace></mspace> </mstyle> <mo>*</mo> </msup> <mrow> <mo>(</mo> <mrow> <msub> <mi>m</mi> <mn>1</mn> </msub> <mo>,</mo> <mi>…</mi> <mo>,</mo> <msub> <mi>m</mi> <mi>k</mi> </msub> </mrow> <mo>)</mo> </mrow> </mrow> </mrow> </semantics></math> asks whether the complete symmetric digraph <span></span><math> <semantics> <mrow> <mrow> <msubsup> <mi>K</mi> <mi>n</mi> <mo>*</mo> </msubsup> </mrow> </mrow> </semantics></math>, assuming <span></span><math> <semantics> <mrow> <mrow> <mi>n</mi> <mo>=</mo> <msub> <mi>m</mi> <mn>1</mn> </msub> <mo>+</mo> <mi>⋯</mi> <mo>+</mo> <msub> <mi>m</mi> <mi>k</mi> </msub> </mrow> </mrow> </semantics></math>, admits a decomposition into spanning subdigraphs, each a disjoint un
有向Oberwolfach问题OP * (m1,…k)问是否完全对称有向图K n *,假设n = m1 +⋯+k,允许分解成生成的子图,每个都是k个长度为m1的有向循环的不相交并,…,我…在此,我们描述了构造OP *()的解的方法。m1,…M (k)给出的解OP * (m 1 有向Oberwolfach问题OP * (m1,…k)问是否完全对称有向图K n *,假设n = m1 +⋯+k,允许分解成生成的子图,每个都是k个长度为m1的有向循环的不相交并,…,我… 在此,我们描述了构造OP *()的解的方法。m1,…M (k)给出的解OP * (m 1,……M (l),对于一些,l &lt;K,如果在m1上的某些条件,M k是满足的。
{"title":"The Directed Oberwolfach Problem With Variable Cycle Lengths: A Recursive Construction","authors":"Suzan Kadri,&nbsp;Mateja Šajna","doi":"10.1002/jcd.21967","DOIUrl":"https://doi.org/10.1002/jcd.21967","url":null,"abstract":"&lt;p&gt;The directed Oberwolfach problem &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msup&gt;\u0000 &lt;mstyle&gt;\u0000 &lt;mspace&gt;&lt;/mspace&gt;\u0000 \u0000 &lt;mtext&gt;OP&lt;/mtext&gt;\u0000 &lt;mspace&gt;&lt;/mspace&gt;\u0000 &lt;/mstyle&gt;\u0000 \u0000 &lt;mo&gt;*&lt;/mo&gt;\u0000 &lt;/msup&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;…&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;msub&gt;\u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; asks whether the complete symmetric digraph &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msubsup&gt;\u0000 &lt;mi&gt;K&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;*&lt;/mo&gt;\u0000 &lt;/msubsup&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, assuming &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;=&lt;/mo&gt;\u0000 \u0000 &lt;msub&gt;\u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;⋯&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 \u0000 &lt;msub&gt;\u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, admits a decomposition into spanning subdigraphs, each a disjoint un","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 7","pages":"239-260"},"PeriodicalIF":0.5,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21967","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143945026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Putatively Optimal Projective Spherical Designs With Little Apparent Symmetry 具有少量明显对称性的推定最优射影球面设计
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-11 DOI: 10.1002/jcd.21979
Alex Elzenaar, Shayne Waldron

We give some new explicit examples of putatively optimal projective spherical designs, that is, ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in general, which requires the introduction of new techniques for their construction. New examples of interest include an 11-point spherical � � (� � 3� � ,� � 3� � )-design for � � R� � 3, and a 12-point spherical � � (� � 2� � ,� � 2� � )-design for � � R� � 4 given by four Mercedes-Benz frames that lie on equi-isoclinic planes. The latter example shows that the set of optimal spherical designs can be uncountable. We also give results of an extensive numerical study to determine the nature of the real algebraic variety of optimal projective real spherical designs, and in particular when it is a single point (a unique design) or corresponds to an infinite family of designs.

我们给出了一些新的明确的假设最优射影球面设计的例子,即那些有数值证据证明它们是最小尺寸的。这些形成连续的家族,因此通常没有明显的对称性,这就需要引入新的建造技术。新的有趣的例子包括11点球面(3),3) R 3的设计;一个12点球面(2)2)给出了r4的设计由四个梅赛德斯-奔驰框架组成,它们位于等斜平面上。后一个例子表明最优球面设计的集合可以是不可数的。我们还给出了广泛的数值研究结果,以确定最优射影实球面设计的实代数变化的性质,特别是当它是单点(唯一设计)或对应于无限族的设计时。
{"title":"Putatively Optimal Projective Spherical Designs With Little Apparent Symmetry","authors":"Alex Elzenaar,&nbsp;Shayne Waldron","doi":"10.1002/jcd.21979","DOIUrl":"https://doi.org/10.1002/jcd.21979","url":null,"abstract":"<p>We give some new explicit examples of putatively optimal projective spherical designs, that is, ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in general, which requires the introduction of new techniques for their construction. New examples of interest include an 11-point spherical <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mn>3</mn>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mn>3</mn>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-design for <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msup>\u0000 <mi>R</mi>\u0000 \u0000 <mn>3</mn>\u0000 </msup>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>, and a 12-point spherical <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mn>2</mn>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mn>2</mn>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-design for <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msup>\u0000 <mi>R</mi>\u0000 \u0000 <mn>4</mn>\u0000 </msup>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> given by four Mercedes-Benz frames that lie on equi-isoclinic planes. The latter example shows that the set of optimal spherical designs can be uncountable. We also give results of an extensive numerical study to determine the nature of the real algebraic variety of optimal projective real spherical designs, and in particular when it is a single point (a unique design) or corresponds to an infinite family of designs.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 6","pages":"222-234"},"PeriodicalIF":0.5,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21979","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143845833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Classification of the Flag-Transitive 2- ( v , 3 , λ ) Designs With v ≡ 1 , 3 ( mod 6 ) and v ≡ 6 ( mod λ ) 一类具有v≡1的2- (v, 3, λ)标志传递设计3 (mod 6)和v≡6 (modλ )
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-05 DOI: 10.1002/jcd.21978
Alessandro Montinaro, Eliana Francot
<div> <p>In this paper, we provide a complete classification of the 2-<span></span><math> <semantics> <mrow> <mrow> <mrow> <mo>(</mo> <mrow> <mi>v</mi> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mi>λ</mi> </mrow> <mo>)</mo> </mrow> </mrow> </mrow> </semantics></math> designs with <span></span><math> <semantics> <mrow> <mrow> <mi>v</mi> <mo>≡</mo> <mn>1</mn> <mo>,</mo> <mn>3</mn> <mspace></mspace> <mrow> <mo>(</mo> <mrow> <mi>mod</mi> <mspace></mspace> <mn>6</mn> </mrow> <mo>)</mo> </mrow> </mrow> </mrow> </semantics></math> and <span></span><math> <semantics> <mrow> <mrow> <mi>v</mi> <mo>≡</mo> <mn>6</mn> <mspace></mspace> <mrow> <mo>(</mo> <mrow> <mi>mod</mi> <mspace></mspace> <mi>λ</mi> </mrow> <mo>)</mo> </mrow> </mrow> </mrow> </semantics></math> admitting a flag-transitive automorphism group non-isomorphic to a subgroup of <span></span><math> <semantics> <mrow> <mrow> <mi>A</mi> <mi>Γ</mi> <msub> <mi>L</mi> <mn>1</mn> </msub>
在本文中,我们提供了2- (v, 3,λ)设计v≡1,3 (mod 6)和V≡6 (mod λ)承认一个与a的子群Γ L 1 (v)不同构的标志传递自同构群) .
{"title":"A Classification of the Flag-Transitive 2-\u0000 \u0000 \u0000 \u0000 \u0000 (\u0000 \u0000 v\u0000 ,\u0000 3\u0000 ,\u0000 λ\u0000 \u0000 )\u0000 \u0000 \u0000 \u0000 Designs With \u0000 \u0000 \u0000 \u0000 v\u0000 ≡\u0000 1\u0000 ,\u0000 3\u0000 \u0000 \u0000 (\u0000 \u0000 mod\u0000 \u0000 6\u0000 \u0000 )\u0000 \u0000 \u0000 \u0000 and \u0000 \u0000 \u0000 \u0000 v\u0000 ≡\u0000 6\u0000 \u0000 \u0000 (\u0000 \u0000 mod\u0000 \u0000 λ\u0000 \u0000 )","authors":"Alessandro Montinaro,&nbsp;Eliana Francot","doi":"10.1002/jcd.21978","DOIUrl":"https://doi.org/10.1002/jcd.21978","url":null,"abstract":"&lt;div&gt;\u0000 \u0000 &lt;p&gt;In this paper, we provide a complete classification of the 2-&lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;3&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;λ&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; designs with &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≡&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;3&lt;/mn&gt;\u0000 &lt;mspace&gt;&lt;/mspace&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;mod&lt;/mi&gt;\u0000 &lt;mspace&gt;&lt;/mspace&gt;\u0000 \u0000 &lt;mn&gt;6&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≡&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;6&lt;/mn&gt;\u0000 &lt;mspace&gt;&lt;/mspace&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;mod&lt;/mi&gt;\u0000 &lt;mspace&gt;&lt;/mspace&gt;\u0000 \u0000 &lt;mi&gt;λ&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; admitting a flag-transitive automorphism group non-isomorphic to a subgroup of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;A&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;Γ&lt;/mi&gt;\u0000 \u0000 &lt;msub&gt;\u0000 &lt;mi&gt;L&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 6","pages":"217-221"},"PeriodicalIF":0.5,"publicationDate":"2025-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143846041","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
GDD Type Spanning Bipartite Block Designs GDD类型跨越二部块设计
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-02-27 DOI: 10.1002/jcd.21976
Shoko Chisaki, Ryoh Fuji-Hara, Nobuko Miyamoto
<div> <p>There is a one-to-one correspondence between the point set of a group divisible design (GDD) with <span></span><math> <semantics> <mrow> <mrow> <msub> <mi>v</mi> <mn>1</mn> </msub> </mrow> </mrow> </semantics></math> groups of <span></span><math> <semantics> <mrow> <mrow> <msub> <mi>v</mi> <mn>2</mn> </msub> </mrow> </mrow> </semantics></math> points and the edge set of a complete bipartite graph <span></span><math> <semantics> <mrow> <mrow> <msub> <mi>K</mi> <mrow> <msub> <mi>v</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>v</mi> <mn>2</mn> </msub> </mrow> </msub> </mrow> </mrow> </semantics></math>. A block of GDD corresponds to a subgraph of <span></span><math> <semantics> <mrow> <mrow> <msub> <mi>K</mi> <mrow> <msub> <mi>v</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>v</mi> <mn>2</mn> </msub> </mrow> </msub> </mrow> </mrow> </semantics></math>. We show that the concurrence conditions of two points of GDD can correspond to the edge concurrence conditions of subgraphs of <span></span><math> <semantics> <mrow> <mrow> <msub> <mi>K</mi> <mrow> <msub>
群可分设计(GDD)的点集与v 2的v 1组之间存在一一对应关系点和完全二部图kv1的边集,V 2。GDD的一个块对应于kv1的一个子图,V 2。我们证明了GDD两点的并发条件可以对应于kv1的子图的边并发条件,我们称之为gdd型跨二部块设计(SBBD)。我们还提出了一种直接从(r)构造SBBD的方法,λ) -设计和群上的差分矩阵。 当an (r)λ) -设计与v点有b块大得多而v,提出了一种改进的方法来构造一个块数更少的SBBD,使v1更接近v2通过划分(r)的块集,λ) -设计。
{"title":"GDD Type Spanning Bipartite Block Designs","authors":"Shoko Chisaki,&nbsp;Ryoh Fuji-Hara,&nbsp;Nobuko Miyamoto","doi":"10.1002/jcd.21976","DOIUrl":"https://doi.org/10.1002/jcd.21976","url":null,"abstract":"&lt;div&gt;\u0000 \u0000 &lt;p&gt;There is a one-to-one correspondence between the point set of a group divisible design (GDD) with &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; groups of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; points and the edge set of a complete bipartite graph &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;K&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;msub&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. A block of GDD corresponds to a subgraph of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;K&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;msub&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. We show that the concurrence conditions of two points of GDD can correspond to the edge concurrence conditions of subgraphs of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;K&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 6","pages":"207-216"},"PeriodicalIF":0.5,"publicationDate":"2025-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143845859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Cycle Switching in Steiner Triple Systems of Order 19 19阶Steiner三重系统的循环切换
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-02-27 DOI: 10.1002/jcd.21975
Grahame Erskine, Terry S. Griggs
<div> <p>Cycle switching is a particular form of transformation applied to isomorphism classes of a Steiner triple system of a given order <span></span><math> <semantics> <mrow> <mrow> <mi>v</mi> </mrow> </mrow> </semantics></math> (an <span></span><math> <semantics> <mrow> <mrow> <mtext>STS</mtext> <mrow> <mo>(</mo> <mi>v</mi> <mo>)</mo> </mrow> </mrow> </mrow> </semantics></math>), yielding another <span></span><math> <semantics> <mrow> <mrow> <mtext>STS</mtext> <mrow> <mo>(</mo> <mi>v</mi> <mo>)</mo> </mrow> </mrow> </mrow> </semantics></math>. This relationship may be represented by an undirected graph. An <span></span><math> <semantics> <mrow> <mrow> <mtext>STS</mtext> <mrow> <mo>(</mo> <mi>v</mi> <mo>)</mo> </mrow> </mrow> </mrow> </semantics></math> admits cycles of lengths <span></span><math> <semantics> <mrow> <mrow> <mn>4</mn> <mo>,</mo> <mn>6</mn> <mo>,</mo> <mi>…</mi> <mo>,</mo> <mi>v</mi> <mo>−</mo> <mn>7</mn> </mrow> </mrow> </semantics></math> and <span></span><math> <semantics> <mrow> <mrow> <mi>v</mi> <mo>−</mo> <mn>3</mn> </mrow> </mrow> </semantics></math>. In the particular case of <span></span><math> <semantics> <mrow>
循环交换是应用于给定阶v(和STS (v)的Steiner三重系统同构类的一种特殊变换形式)),产生另一个化粪池系统(v)。这种关系可以用无向图来表示。STS (v)允许长度为4的循环,6、……V−7和V−3。在v = 19的特殊情况下,已知允许任意长度的循环切换的全切换图是连通的。我们证明,如果我们只限制切换到一个可能的周期长度,在所有情况下,切换图是断开的(即使我们忽略那些STS (19) s),它们没有给定长度的循环)。此外,在许多情况下,我们发现在切换图中有趣的连接组件,它们表现出意想不到的对称性。我们的方法利用一种算法来确定一个非常大的隐式定义图中的连接组件,这比以前的方法更有效,避免了对大部分系统计算规范标记的必要性。
{"title":"Cycle Switching in Steiner Triple Systems of Order 19","authors":"Grahame Erskine,&nbsp;Terry S. Griggs","doi":"10.1002/jcd.21975","DOIUrl":"https://doi.org/10.1002/jcd.21975","url":null,"abstract":"&lt;div&gt;\u0000 \u0000 &lt;p&gt;Cycle switching is a particular form of transformation applied to isomorphism classes of a Steiner triple system of a given order &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; (an &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mtext&gt;STS&lt;/mtext&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;), yielding another &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mtext&gt;STS&lt;/mtext&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. This relationship may be represented by an undirected graph. An &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mtext&gt;STS&lt;/mtext&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; admits cycles of lengths &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;4&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;6&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;…&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;−&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;7&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;−&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;3&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. In the particular case of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 5","pages":"195-204"},"PeriodicalIF":0.5,"publicationDate":"2025-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143595458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
More Heffter Spaces via Finite Fields 通过有限域得到更多的空间
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-02-23 DOI: 10.1002/jcd.21974
Marco Buratti, Anita Pasotti
<div> <p>A <span></span><math> <semantics> <mrow> <mrow> <mrow> <mo>(</mo> <mrow> <mi>v</mi> <mo>,</mo> <mi>k</mi> <mo>;</mo> <mi>r</mi> </mrow> <mo>)</mo> </mrow> </mrow> </mrow> </semantics></math> Heffter space is a resolvable <span></span><math> <semantics> <mrow> <mrow> <mrow> <mo>(</mo> <mrow> <msub> <mi>v</mi> <mi>r</mi> </msub> <mo>,</mo> <msub> <mi>b</mi> <mi>k</mi> </msub> </mrow> <mo>)</mo> </mrow> </mrow> </mrow> </semantics></math> configuration whose points form a half-set of an abelian group <span></span><math> <semantics> <mrow> <mrow> <mi>G</mi> </mrow> </mrow> </semantics></math> and whose blocks are all zero-sum in <span></span><math> <semantics> <mrow> <mrow> <mi>G</mi> </mrow> </mrow> </semantics></math>. It was recently proved that there are infinitely many orders <span></span><math> <semantics> <mrow> <mrow> <mi>v</mi> </mrow> </mrow> </semantics></math> for which, given any pair <span></span><math> <semantics> <mrow> <mrow> <mrow> <mo>(</mo> <mrow> <mi>k</mi> <mo>,</mo> <mi>r</mi> </mrow>
A (v, k;hffter空间是一个可分辨的(v r),b (k)位形,其点构成阿贝尔群G的半集它的方块在G中都是零和的。最近证明了存在无穷多个v阶,对于任意一对(k)R) k≥3奇数,A (v, k;r) Heffter空间存在。这是通过施加一个点正则自同构群得到的。在这里,我们通过要求一个点半正则自同构群来放宽这个要求。这样,上述结果也可以推广到k为偶数的情况。
{"title":"More Heffter Spaces via Finite Fields","authors":"Marco Buratti,&nbsp;Anita Pasotti","doi":"10.1002/jcd.21974","DOIUrl":"https://doi.org/10.1002/jcd.21974","url":null,"abstract":"&lt;div&gt;\u0000 \u0000 &lt;p&gt;A &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;;&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; Heffter space is a resolvable &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;msub&gt;\u0000 &lt;mi&gt;b&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; configuration whose points form a half-set of an abelian group &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and whose blocks are all zero-sum in &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. It was recently proved that there are infinitely many orders &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; for which, given any pair &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 5","pages":"188-194"},"PeriodicalIF":0.5,"publicationDate":"2025-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143595699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Pairs in Nested Steiner Quadruple Systems 嵌套Steiner四重系统中的对
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-02-20 DOI: 10.1002/jcd.21973
Yeow Meng Chee, Son Hoang Dau, Tuvi Etzion, Han Mao Kiah, Wenqin Zhang

Motivated by a repair problem for fractional repetition codes in distributed storage, each block of any Steiner quadruple system (SQS) of order � � v is partitioned into two pairs. Each pair in such a partition is called a nested design pair, and its multiplicity is the number of times it is a pair in this partition. Such a partition of each block is considered a new block design called a nested SQS. Several related questions on this type of design are considered in this paper: What is the maximum multiplicity of the nested design pair with minimum multiplicity? What is the minimum multiplicity of the nested design pair with maximum multiplicity? Are there nested quadruple systems in which all the nested design pairs have the same multiplicity? Of special interest are nested quadruple systems in which all the � � v� � 2 pairs are nested design pairs with the same multiplicity. Several constructions of nested quadruple systems are considered, and in particular, classic constructions of SQS are examined.

针对分布式存储中分数阶重复码的修复问题,将任意v阶Steiner四重系统(SQS)的每个块划分为两对。这种分区中的每对设计对称为嵌套设计对,其多重性是在该分区中成为一对的次数。每个块的这样一个分区被认为是一个新的块设计,称为嵌套SQS。本文考虑了这类设计的几个相关问题:具有最小多重性的嵌套设计对的最大多重性是什么?具有最大多重性的嵌套设计对的最小多重性是什么?是否存在嵌套的四重系统,其中所有嵌套的设计对具有相同的多重性?特别有趣的是嵌套四重系统,其中所有的v2对都是具有相同多重性的嵌套设计对。考虑了嵌套四重系统的几种结构,特别是对SQS的经典结构进行了研究。
{"title":"Pairs in Nested Steiner Quadruple Systems","authors":"Yeow Meng Chee,&nbsp;Son Hoang Dau,&nbsp;Tuvi Etzion,&nbsp;Han Mao Kiah,&nbsp;Wenqin Zhang","doi":"10.1002/jcd.21973","DOIUrl":"https://doi.org/10.1002/jcd.21973","url":null,"abstract":"<div>\u0000 \u0000 <p>Motivated by a repair problem for fractional repetition codes in distributed storage, each block of any Steiner quadruple system (SQS) of order <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>v</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> is partitioned into two pairs. Each pair in such a partition is called a nested design pair, and its multiplicity is the number of times it is a pair in this partition. Such a partition of each block is considered a new block design called a nested SQS. Several related questions on this type of design are considered in this paper: What is the maximum multiplicity of the nested design pair with minimum multiplicity? What is the minimum multiplicity of the nested design pair with maximum multiplicity? Are there nested quadruple systems in which all the nested design pairs have the same multiplicity? Of special interest are nested quadruple systems in which all the <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mfenced>\u0000 <mfrac>\u0000 <mi>v</mi>\u0000 \u0000 <mn>2</mn>\u0000 </mfrac>\u0000 </mfenced>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> pairs are nested design pairs with the same multiplicity. Several constructions of nested quadruple systems are considered, and in particular, classic constructions of SQS are examined.</p>\u0000 </div>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 5","pages":"177-187"},"PeriodicalIF":0.5,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143595452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Combinatorial Designs
全部 Geobiology Appl. Clay Sci. Geochim. Cosmochim. Acta J. Hydrol. Org. Geochem. Carbon Balance Manage. Contrib. Mineral. Petrol. Int. J. Biometeorol. IZV-PHYS SOLID EART+ J. Atmos. Chem. Acta Oceanolog. Sin. Acta Geophys. ACTA GEOL POL ACTA PETROL SIN ACTA GEOL SIN-ENGL AAPG Bull. Acta Geochimica Adv. Atmos. Sci. Adv. Meteorol. Am. J. Phys. Anthropol. Am. J. Sci. Am. Mineral. Annu. Rev. Earth Planet. Sci. Appl. Geochem. Aquat. Geochem. Ann. Glaciol. Archaeol. Anthropol. Sci. ARCHAEOMETRY ARCT ANTARCT ALP RES Asia-Pac. J. Atmos. Sci. ATMOSPHERE-BASEL Atmos. Res. Aust. J. Earth Sci. Atmos. Chem. Phys. Atmos. Meas. Tech. Basin Res. Big Earth Data BIOGEOSCIENCES Geostand. Geoanal. Res. GEOLOGY Geosci. J. Geochem. J. Geochem. Trans. Geosci. Front. Geol. Ore Deposits Global Biogeochem. Cycles Gondwana Res. Geochem. Int. Geol. J. Geophys. Prospect. Geosci. Model Dev. GEOL BELG GROUNDWATER Hydrogeol. J. Hydrol. Earth Syst. Sci. Hydrol. Processes Int. J. Climatol. Int. J. Earth Sci. Int. Geol. Rev. Int. J. Disaster Risk Reduct. Int. J. Geomech. Int. J. Geog. Inf. Sci. Isl. Arc J. Afr. Earth. Sci. J. Adv. Model. Earth Syst. J APPL METEOROL CLIM J. Atmos. Oceanic Technol. J. Atmos. Sol. Terr. Phys. J. Clim. J. Earth Sci. J. Earth Syst. Sci. J. Environ. Eng. Geophys. J. Geog. Sci. Mineral. Mag. Miner. Deposita Mon. Weather Rev. Nat. Hazards Earth Syst. Sci. Nat. Clim. Change Nat. Geosci. Ocean Dyn. Ocean and Coastal Research npj Clim. Atmos. Sci. Ocean Modell. Ocean Sci. Ore Geol. Rev. OCEAN SCI J Paleontol. J. PALAEOGEOGR PALAEOCL PERIOD MINERAL PETROLOGY+ Phys. Chem. Miner. Polar Sci. Prog. Oceanogr. Quat. Sci. Rev. Q. J. Eng. Geol. Hydrogeol. RADIOCARBON Pure Appl. Geophys. Resour. Geol. Rev. Geophys. Sediment. Geol.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1