Journal of Combinatorial Designs最新文献
筛选
英文
中文
New results on large sets of orthogonal arrays and orthogonal arrays
关于大型正交阵列集和正交阵列的新成果
IF 0.7
4区 数学
Guangzhou Chen, Xiaodong Niu, Jiufeng Shi
{"title":"New results on large sets of orthogonal arrays and orthogonal arrays","authors":"Guangzhou Chen, Xiaodong Niu, Jiufeng Shi","doi":"10.1002/jcd.21944","DOIUrl":"10.1002/jcd.21944","url":null,"abstract":"<p>Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory, and cryptography. In this paper, some new series of large sets of orthogonal arrays are given by direct construction, juxtaposition construction, Hadamard construction, finite field construction, and difference matrix construction. Subsequently, many new infinite classes of orthogonal arrays are obtained by using these large sets of orthogonal arrays and Kronecker product.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 8","pages":"488-515"},"PeriodicalIF":0.7,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140930827","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
The Terwilliger algebras of the group association schemes of three metacyclic groups
三个元环群的群联方案的特尔维利格代数
IF 0.7
4区 数学
Jing Yang, Xiaoqian Zhang, Lihua Feng
{"title":"The Terwilliger algebras of the group association schemes of three metacyclic groups","authors":"Jing Yang, Xiaoqian Zhang, Lihua Feng","doi":"10.1002/jcd.21941","DOIUrl":"10.1002/jcd.21941","url":null,"abstract":"<p>For any finite group <span></span><math>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow></math>, the Terwilliger algebra <span></span><math>\u0000 \u0000 <mrow>\u0000 <mi>T</mi>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>G</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow></math> of the group association scheme satisfies the following inclusions: <span></span><math>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>T</mi>\u0000 \u0000 <mn>0</mn>\u0000 </msub>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>G</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 \u0000 <mo>⊆</mo>\u0000 \u0000 <mi>T</mi>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>G</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 \u0000 <mo>⊆</mo>\u0000 \u0000 <mover>\u0000 <mi>T</mi>\u0000 \u0000 <mo>˜</mo>\u0000 </mover>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>G</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow></math>, where <span></span><math>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>T</mi>\u0000 \u0000 <mn>0</mn>\u0000 </msub>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>G</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow></math> is a specific vector space and <span></span><math>\u0000 \u0000 <mrow>\u0000 <mover>\u0000 <mi>T</mi>\u0000 \u0000 <mo>˜</mo>\u0000 </mover>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>G</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow></math> is the centralizer algebra of the permutation representation of <span></span><math>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow></math> induced by the action of conjugation. The group <span></span><math>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow></math> is said to be triply transitive if <span></span><math>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>T</mi>\u0000 \u0000 <mn>0</mn>\u0000 </msub>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>G</mi>\u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 8","pages":"438-463"},"PeriodicalIF":0.7,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140799847","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 equitably 2-colourable odd cycle decompositions
关于等效 2 奇循环分解
IF 0.7
4区 数学
Andrea Burgess, Francesca Merola
{"title":"On equitably 2-colourable odd cycle decompositions","authors":"Andrea Burgess, Francesca Merola","doi":"10.1002/jcd.21937","DOIUrl":"10.1002/jcd.21937","url":null,"abstract":"<p>An <span></span><math>\u0000 \u0000 <mrow>\u0000 <mi>ℓ</mi>\u0000 </mrow></math>-cycle decomposition of <span></span><math>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>K</mi>\u0000 \u0000 <mi>v</mi>\u0000 </msub>\u0000 </mrow></math> is said to be <i>equitably 2-colourable</i> if there is a 2-vertex-colouring of <span></span><math>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>K</mi>\u0000 \u0000 <mi>v</mi>\u0000 </msub>\u0000 </mrow></math> such that each colour is represented (approximately) an equal number of times on each cycle: more precisely, we ask that in each cycle <span></span><math>\u0000 \u0000 <mrow>\u0000 <mi>C</mi>\u0000 </mrow></math> of the decomposition, each colour appears on <span></span><math>\u0000 \u0000 <mrow>\u0000 <mrow>\u0000 <mo>⌊</mo>\u0000 \u0000 <mrow>\u0000 <mi>ℓ</mi>\u0000 \u0000 <mo>∕</mo>\u0000 \u0000 <mn>2</mn>\u0000 </mrow>\u0000 \u0000 <mo>⌋</mo>\u0000 </mrow>\u0000 </mrow></math> or <span></span><math>\u0000 \u0000 <mrow>\u0000 <mrow>\u0000 <mo>⌈</mo>\u0000 \u0000 <mrow>\u0000 <mi>ℓ</mi>\u0000 \u0000 <mo>∕</mo>\u0000 \u0000 <mn>2</mn>\u0000 </mrow>\u0000 \u0000 <mo>⌉</mo>\u0000 </mrow>\u0000 </mrow></math> of the vertices of <span></span><math>\u0000 \u0000 <mrow>\u0000 <mi>C</mi>\u0000 </mrow></math>. In this paper we study the existence of equitably 2-colourable <span></span><math>\u0000 \u0000 <mrow>\u0000 <mi>ℓ</mi>\u0000 </mrow></math>-cycle decompositions of <span></span><math>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>K</mi>\u0000 \u0000 <mi>v</mi>\u0000 </msub>\u0000 </mrow></math>, where <span></span><math>\u0000 \u0000 <mrow>\u0000 <mi>ℓ</mi>\u0000 </mrow></math> is odd, and prove the existence of such a decomposition for <span></span><math>\u0000 \u0000 <mrow>\u0000 <mi>v</mi>\u0000 \u0000 <mo>≡</mo>\u0000 \u0000 <mn>1</mn>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>ℓ</mi>\u0000 </mrow></math> (mod <span></span><math>\u0000 \u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 8","pages":"419-437"},"PeriodicalIF":0.7,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21937","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140630988","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
Maximal cocliques and the chromatic number of the Kneser graph on chambers of PG ( 3 , q ) $(3,q)$
PG(3,q)室上克奈瑟图的最大茧和色度数
IF 0.7
4区 数学
Philipp Heering, Klaus Metsch
{"title":"Maximal cocliques and the chromatic number of the Kneser graph on chambers of PG\u0000 \u0000 \u0000 \u0000 (\u0000 \u0000 3\u0000 ,\u0000 q\u0000 \u0000 )\u0000 \u0000 \u0000 $(3,q)$","authors":"Philipp Heering, Klaus Metsch","doi":"10.1002/jcd.21940","DOIUrl":"10.1002/jcd.21940","url":null,"abstract":"<p>Let <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>Γ</mi>\u0000 </mrow>\u0000 <annotation> ${rm{Gamma }}$</annotation>\u0000 </semantics></math> be the graph whose vertices are the chambers of the finite projective 3-space <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mtext>PG</mtext>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 <mrow>\u0000 <mn>3</mn>\u0000 <mo>,</mo>\u0000 <mi>q</mi>\u0000 </mrow>\u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $text{PG}(3,q)$</annotation>\u0000 </semantics></math>, with two vertices being adjacent if and only if the corresponding chambers are in general position. We show that a maximal independent set of vertices of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>Γ</mi>\u0000 </mrow>\u0000 <annotation> ${rm{Gamma }}$</annotation>\u0000 </semantics></math> contains <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msup>\u0000 <mi>q</mi>\u0000 <mn>4</mn>\u0000 </msup>\u0000 <mo>+</mo>\u0000 <mn>3</mn>\u0000 <msup>\u0000 <mi>q</mi>\u0000 <mn>3</mn>\u0000 </msup>\u0000 <mo>+</mo>\u0000 <mn>4</mn>\u0000 <msup>\u0000 <mi>q</mi>\u0000 <mn>2</mn>\u0000 </msup>\u0000 <mo>+</mo>\u0000 <mn>3</mn>\u0000 <mi>q</mi>\u0000 <mo>+</mo>\u0000 <mn>1</mn>\u0000 </mrow>\u0000 <annotation> ${q}^{4}+3{q}^{3}+4{q}^{2}+3q+1$</annotation>\u0000 </semantics></math>, or <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>3</mn>\u0000 <msup>\u0000 <mi>q</mi>\u0000 <mn>3</mn>\u0000 </msup>\u0000 <mo>+</mo>\u0000 <mn>5</mn>\u0000 <msup>\u0000 <mi>q</mi>\u0000 <mn>2</mn>\u0000 </msup>\u0000 <mo>+</mo>\u0000 <mn>3</mn>\u0000 <mi>q</mi>\u0000 <mo>+</mo>\u0000 <mn>1</mn>\u0000 </mrow>\u0000 <annotation> $3{q}^{3}+5{q}^{2}+3q+1$</annotation>\u0000 </semantics></math>, or at most <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>3</mn>\u0000 <msup>\u0000 <mi>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 7","pages":"388-409"},"PeriodicalIF":0.7,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21940","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570787","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
An explicit construction for large sets of infinite dimensional q $q$ -Steiner systems
无穷维 q-Steiner 系统大集合的显式构造
IF 0.7
4区 数学
Daniel R. Hawtin
{"title":"An explicit construction for large sets of infinite dimensional \u0000 \u0000 \u0000 q\u0000 \u0000 $q$\u0000 -Steiner systems","authors":"Daniel R. Hawtin","doi":"10.1002/jcd.21942","DOIUrl":"10.1002/jcd.21942","url":null,"abstract":"<p>Let <span></span><math>\u0000 \u0000 <semantics>\u0000 <mrow>\u0000 <mi>V</mi>\u0000 </mrow>\u0000 <annotation> $V$</annotation>\u0000 </semantics></math> be a vector space over the finite field <span></span><math>\u0000 \u0000 <semantics>\u0000 <mrow>\u0000 <msub>\u0000 <mi>F</mi>\u0000 \u0000 <mi>q</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> ${{mathbb{F}}}_{q}$</annotation>\u0000 </semantics></math>. A <span></span><math>\u0000 \u0000 <semantics>\u0000 <mrow>\u0000 <mi>q</mi>\u0000 </mrow>\u0000 <annotation> $q$</annotation>\u0000 </semantics></math>-<i>Steiner system</i>, or an <span></span><math>\u0000 \u0000 <semantics>\u0000 <mrow>\u0000 <mi>S</mi>\u0000 \u0000 <msub>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mi>t</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>k</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>V</mi>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 \u0000 <mi>q</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> $S{(t,k,V)}_{q}$</annotation>\u0000 </semantics></math>, is a collection <span></span><math>\u0000 \u0000 <semantics>\u0000 <mrow>\u0000 <mi>ℬ</mi>\u0000 </mrow>\u0000 <annotation> ${rm{{mathcal B}}}$</annotation>\u0000 </semantics></math> of <span></span><math>\u0000 \u0000 <semantics>\u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 <annotation> $k$</annotation>\u0000 </semantics></math>-dimensional subspaces of <span></span><math>\u0000 \u0000 <semantics>\u0000 <mrow>\u0000 <mi>V</mi>\u0000 </mrow>\u0000 <annotation> $V$</annotation>\u0000 </semantics></math> such that every <span></span><math>\u0000 \u0000 <semantics>\u0000 <mrow>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 <annotation> $t$</annotation>\u0000 </semantics></math>-dimensional subspace of <span></span><math>\u0000 \u0000 <semantics>\u0000 <mrow>\u0000 <mi>V</mi>\u0000 </mrow>\u0000 <annotation> $V$</annotation>\u0000 </semantics></math> is contained in a unique element of <span></span><math>\u0000 \u0000 <semantics>\u0000 <mrow>\u0000 <mi>ℬ</mi>\u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 8","pages":"413-418"},"PeriodicalIF":0.7,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570622","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
Genuinely nonabelian partial difference sets
真正非阿贝尔局部差集
IF 0.7
4区 数学
John Polhill, James A. Davis, Ken W. Smith, Eric Swartz
{"title":"Genuinely nonabelian partial difference sets","authors":"John Polhill, James A. Davis, Ken W. Smith, Eric Swartz","doi":"10.1002/jcd.21938","DOIUrl":"10.1002/jcd.21938","url":null,"abstract":"<p>Strongly regular graphs (SRGs) provide a fertile area of exploration in algebraic combinatorics, integrating techniques in graph theory, linear algebra, group theory, finite fields, finite geometry, and number theory. Of particular interest are those SRGs with a large automorphism group. If an automorphism group acts regularly (sharply transitively) on the vertices of the graph, then we may identify the graph with a subset of the group, a partial difference set (PDS), which allows us to apply techniques from group theory to examine the graph. Much of the work over the past four decades has concentrated on abelian PDSs using the powerful techniques of character theory. However, little work has been done on nonabelian PDSs. In this paper we point out the existence of <i>genuinely nonabelian</i> PDSs, that is, PDSs for parameter sets where a nonabelian group is the only possible regular automorphism group. We include methods for demonstrating that abelian PDSs are not possible for a particular set of parameters or for a particular SRG. Four infinite families of genuinely nonabelian PDSs are described, two of which—one arising from triangular graphs and one arising from Krein covers of complete graphs constructed by Godsil—are new. We also include a new nonabelian PDS found by computer search and present some possible future directions of research.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 7","pages":"351-370"},"PeriodicalIF":0.7,"publicationDate":"2024-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21938","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570623","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
Doubly sequenceable groups
双序列群
IF 0.7
4区 数学
Mohammad Javaheri
{"title":"Doubly sequenceable groups","authors":"Mohammad Javaheri","doi":"10.1002/jcd.21939","DOIUrl":"10.1002/jcd.21939","url":null,"abstract":"<p>Given a sequence <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>g</mi>\u0000 \u0000 <mo>:</mo>\u0000 \u0000 <msub>\u0000 <mi>g</mi>\u0000 \u0000 <mn>0</mn>\u0000 </msub>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>…</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <msub>\u0000 <mi>g</mi>\u0000 \u0000 <mi>m</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> ${bf{g}}:{g}_{0},{rm{ldots }},{g}_{m}$</annotation>\u0000 </semantics></math> in a finite group <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 <annotation> $G$</annotation>\u0000 </semantics></math> with <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msub>\u0000 <mi>g</mi>\u0000 \u0000 <mn>0</mn>\u0000 </msub>\u0000 \u0000 <mo>=</mo>\u0000 \u0000 <msub>\u0000 <mn>1</mn>\u0000 \u0000 <mi>G</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> ${g}_{0}={1}_{G}$</annotation>\u0000 </semantics></math>, let <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mover>\u0000 <mi>g</mi>\u0000 \u0000 <mo>¯</mo>\u0000 </mover>\u0000 \u0000 <mo>:</mo>\u0000 \u0000 <msub>\u0000 <mover>\u0000 <mi>g</mi>\u0000 \u0000 <mo>¯</mo>\u0000 </mover>\u0000 \u0000 <mn>0</mn>\u0000 </msub>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>…</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <msub>\u0000 <mover>\u0000 <mi>g</mi>\u0000 \u0000 <mo>¯</mo>\u0000 </mover>\u0000 \u0000 <mi>m</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> $bar{{bf{g}}}:{bar{g}}_{0},{rm{ldots }},{bar{g}}_{m}$</annotation>\u0000 </semantics></math> be the sequence of consecutive quotients of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>g</mi>\u0000 </mrow>\u0000 <annotation> ${bf{g}}$</annotation>\u0000 </semantics></math> defined by <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msub>\u0000 <mover>\u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 7","pages":"371-387"},"PeriodicalIF":0.7,"publicationDate":"2024-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140570602","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
Group divisible designs with block size 4 and group sizes 4 and 7
组块大小为 4，组块大小为 4 和 7 的可分割设计
IF 0.7
4区 数学
R. Julian R. Abel, Thomas Britz, Yudhistira A. Bunjamin, Diana Combe
{"title":"Group divisible designs with block size 4 and group sizes 4 and 7","authors":"R. Julian R. Abel, Thomas Britz, Yudhistira A. Bunjamin, Diana Combe","doi":"10.1002/jcd.21932","DOIUrl":"https://doi.org/10.1002/jcd.21932","url":null,"abstract":"<p>In this paper, we consider the existence of group divisible designs (GDDs) with block size <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>4</mn>\u0000 </mrow>\u0000 <annotation> $4$</annotation>\u0000 </semantics></math> and group sizes <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>4</mn>\u0000 </mrow>\u0000 <annotation> $4$</annotation>\u0000 </semantics></math> and <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>7</mn>\u0000 </mrow>\u0000 <annotation> $7$</annotation>\u0000 </semantics></math>. We show that there exists a <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>4</mn>\u0000 </mrow>\u0000 <annotation> $4$</annotation>\u0000 </semantics></math>-GDD of type <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msup>\u0000 <mn>4</mn>\u0000 <mi>t</mi>\u0000 </msup>\u0000 <msup>\u0000 <mn>7</mn>\u0000 <mi>s</mi>\u0000 </msup>\u0000 </mrow>\u0000 <annotation> ${4}^{t}{7}^{s}$</annotation>\u0000 </semantics></math> for all but a finite specified set of feasible values for <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 <mrow>\u0000 <mi>t</mi>\u0000 <mo>,</mo>\u0000 <mi>s</mi>\u0000 </mrow>\u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $(t,s)$</annotation>\u0000 </semantics></math>.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 6","pages":"328-346"},"PeriodicalIF":0.7,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21932","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140553167","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
Alternating parity weak sequencing
交替奇偶校验弱排序
IF 0.7
4区 数学
Simone Costa, Stefano Della Fiore
{"title":"Alternating parity weak sequencing","authors":"Simone Costa, Stefano Della Fiore","doi":"10.1002/jcd.21936","DOIUrl":"10.1002/jcd.21936","url":null,"abstract":"<p>A subset <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>S</mi>\u0000 </mrow>\u0000 <annotation> $S$</annotation>\u0000 </semantics></math> of a group <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 <mrow>\u0000 <mi>G</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mo>+</mo>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 <annotation> $(G,+)$</annotation>\u0000 </semantics></math> is <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 <annotation> $t$</annotation>\u0000 </semantics></math>-<i>weakly sequenceable</i> if there is an ordering <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 <mrow>\u0000 <msub>\u0000 <mi>y</mi>\u0000 \u0000 <mn>1</mn>\u0000 </msub>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>…</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <msub>\u0000 <mi>y</mi>\u0000 \u0000 <mi>k</mi>\u0000 </msub>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 <annotation> $({y}_{1},{rm{ldots }},{y}_{k})$</annotation>\u0000 </semantics></math> of its elements such that the partial sums <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msub>\u0000 <mi>s</mi>\u0000 \u0000 <mn>0</mn>\u0000 </msub>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <msub>\u0000 <mi>s</mi>\u0000 \u0000 <mn>1</mn>\u0000 </msub>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>…</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <msub>\u0000 <mi>s</mi>\u0000 \u0000 <mi>k</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> ${s}_{0},{s}_{1},{rm{ldots }},{s}_{k}$</annotation>\u0000 </semantics></math>, given by <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msub>\u0000 <mi>s</mi>\u0000 \u0000 <mn>0</mn>\u0000 </msub>\u0000 \u0000 <mo>=</mo>\u0000 \u0000 <mn>0</mn>\u0000 </mrow>\u0000 <annotation> ${s}_{0}=0$</annotation>\u0000 </","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 6","pages":"308-327"},"PeriodicalIF":0.7,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139978158","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
The existence of 2 3 ${2}^{3}$ -decomposable super-simple ( v , 4 , 6 ) $(v,4,6)$ -BIBDs
存在23个可分解的超简单（v,4,6）$(v,4,6)$-BIBDs
IF 0.7
4区 数学
Huangsheng Yu, Jingyuan Chen, R. Julian R. Abel, Dianhua Wu
{"title":"The existence of \u0000 \u0000 \u0000 \u0000 2\u0000 3\u0000 \u0000 \u0000 ${2}^{3}$\u0000 -decomposable super-simple \u0000 \u0000 \u0000 \u0000 (\u0000 \u0000 v\u0000 ,\u0000 4\u0000 ,\u0000 6\u0000 \u0000 )\u0000 \u0000 \u0000 $(v,4,6)$\u0000 -BIBDs","authors":"Huangsheng Yu, Jingyuan Chen, R. Julian R. Abel, Dianhua Wu","doi":"10.1002/jcd.21935","DOIUrl":"10.1002/jcd.21935","url":null,"abstract":"<p>A design is said to be <i>super-simple</i> if the intersection of any two blocks has at most two elements. A design with index <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>t</mi>\u0000 <mi>λ</mi>\u0000 </mrow>\u0000 <annotation> $tlambda $</annotation>\u0000 </semantics></math> is said to be <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msup>\u0000 <mi>λ</mi>\u0000 <mi>t</mi>\u0000 </msup>\u0000 </mrow>\u0000 <annotation> ${lambda }^{t}$</annotation>\u0000 </semantics></math>-<i>decomposable</i>, if its blocks can be partitioned into nonempty collections <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msub>\u0000 <mi>B</mi>\u0000 <mi>i</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> ${{rm{ {mathcal B} }}}_{i}$</annotation>\u0000 </semantics></math>, <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>1</mn>\u0000 <mo>≤</mo>\u0000 <mi>i</mi>\u0000 <mo>≤</mo>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 <annotation> $1le ile t$</annotation>\u0000 </semantics></math>, such that each <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msub>\u0000 <mi>B</mi>\u0000 <mi>i</mi>\u0000 </msub>\u0000 </mrow>\u0000 <annotation> ${{rm{ {mathcal B} }}}_{i}$</annotation>\u0000 </semantics></math> with the point set forms a design with index <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>λ</mi>\u0000 </mrow>\u0000 <annotation> $lambda $</annotation>\u0000 </semantics></math>. In this paper, it is proved that there exists a <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msup>\u0000 <mn>2</mn>\u0000 <mn>3</mn>\u0000 </msup>\u0000 </mrow>\u0000 <annotation> ${2}^{3}$</annotation>\u0000 </semantics></math>-decomposable super-simple <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 <mrow>\u0000 <mi>v</mi>\u0000 <mo>,</mo>\u0000 <mn>4</mn>\u0000 <mo>,</mo>\u0000 <mn>6</mn>\u0000 </mrow>\u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $(v,4,6)$</annotation>\u0000 </semantics></math>-BIBD (balanced incomplete block design) if and only if <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>v</mi>\u0000 <mo>≥</mo>\u0000","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 6","pages":"297-307"},"PeriodicalIF":0.7,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139946643","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
影响因子
展开
类型
展开
期刊
展开
全部
Acc. Chem. Res.
ACS Applied Bio Materials
ACS Appl. Electron. Mater.
ACS Appl. Energy Mater.
ACS Appl. Mater. Interfaces
ACS Appl. Nano Mater.
ACS Appl. Polym. Mater.
ACS BIOMATER-SCI ENG
ACS Catal.
ACS Cent. Sci.
ACS Chem. Biol.
ACS Chemical Health & Safety
ACS Chem. Neurosci.
ACS Comb. Sci.
ACS Earth Space Chem.
ACS Energy Lett.
ACS Infect. Dis.
ACS Macro Lett.
ACS Mater. Lett.
ACS Med. Chem. Lett.
ACS Nano
ACS Omega
ACS Photonics
ACS Sens.
ACS Sustainable Chem. Eng.
ACS Synth. Biol.
Anal. Chem.
BIOCHEMISTRY-US
Bioconjugate Chem.
BIOMACROMOLECULES
Chem. Res. Toxicol.
Chem. Rev.
Chem. Mater.
CRYST GROWTH DES
ENERG FUEL
Environ. Sci. Technol.
Environ. Sci. Technol. Lett.
Eur. J. Inorg. Chem.
IND ENG CHEM RES
Inorg. Chem.
J. Agric. Food. Chem.
J. Chem. Eng. Data
J. Chem. Educ.
J. Chem. Inf. Model.
J. Chem. Theory Comput.
J. Med. Chem.
J. Nat. Prod.
J PROTEOME RES
J. Am. Chem. Soc.
LANGMUIR
MACROMOLECULES
Mol. Pharmaceutics
Nano Lett.
Org. Lett.
ORG PROCESS RES DEV
ORGANOMETALLICS
J. Org. Chem.
J. Phys. Chem.
J. Phys. Chem. A
J. Phys. Chem. B
J. Phys. Chem. C
J. Phys. Chem. Lett.
Analyst
Anal. Methods
Biomater. Sci.
Catal. Sci. Technol.
Chem. Commun.
Chem. Soc. Rev.
CHEM EDUC RES PRACT
CRYSTENGCOMM
Dalton Trans.
Energy Environ. Sci.
ENVIRON SCI-NANO
ENVIRON SCI-PROC IMP
ENVIRON SCI-WAT RES
Faraday Discuss.
Food Funct.
Green Chem.
Inorg. Chem. Front.
Integr. Biol.
J. Anal. At. Spectrom.
J. Mater. Chem. A
J. Mater. Chem. B
J. Mater. Chem. C
Lab Chip
Mater. Chem. Front.
Mater. Horiz.
MEDCHEMCOMM
Metallomics
Mol. Biosyst.
Mol. Syst. Des. Eng.
Nanoscale
Nanoscale Horiz.
Nat. Prod. Rep.
New J. Chem.
Org. Biomol. Chem.
Org. Chem. Front.
PHOTOCH PHOTOBIO SCI
PCCP
Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX
EndNote
RefMan
NoteFirst
NoteExpress
求助内容：
应助结果提醒方式：请完成安全验证×
京公网安备 11010802042870号
