Huangsheng Yu, Jingyuan Chen, R. Julian R. Abel, Dianhua Wu
{"title":"存在23个可分解的超简单(v,4,6)$(v,4,6)$-BIBDs","authors":"Huangsheng Yu, Jingyuan Chen, R. Julian R. Abel, Dianhua Wu","doi":"10.1002/jcd.21935","DOIUrl":null,"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>\n <semantics>\n <mrow>\n <mi>t</mi>\n <mi>λ</mi>\n </mrow>\n <annotation> $t\\lambda $</annotation>\n </semantics></math> is said to be <span></span><math>\n <semantics>\n <mrow>\n <msup>\n <mi>λ</mi>\n <mi>t</mi>\n </msup>\n </mrow>\n <annotation> ${\\lambda }^{t}$</annotation>\n </semantics></math>-<i>decomposable</i>, if its blocks can be partitioned into nonempty collections <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mi>B</mi>\n <mi>i</mi>\n </msub>\n </mrow>\n <annotation> ${{\\rm{ {\\mathcal B} }}}_{i}$</annotation>\n </semantics></math>, <span></span><math>\n <semantics>\n <mrow>\n <mn>1</mn>\n <mo>≤</mo>\n <mi>i</mi>\n <mo>≤</mo>\n <mi>t</mi>\n </mrow>\n <annotation> $1\\le i\\le t$</annotation>\n </semantics></math>, such that each <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mi>B</mi>\n <mi>i</mi>\n </msub>\n </mrow>\n <annotation> ${{\\rm{ {\\mathcal B} }}}_{i}$</annotation>\n </semantics></math> with the point set forms a design with index <span></span><math>\n <semantics>\n <mrow>\n <mi>λ</mi>\n </mrow>\n <annotation> $\\lambda $</annotation>\n </semantics></math>. In this paper, it is proved that there exists a <span></span><math>\n <semantics>\n <mrow>\n <msup>\n <mn>2</mn>\n <mn>3</mn>\n </msup>\n </mrow>\n <annotation> ${2}^{3}$</annotation>\n </semantics></math>-decomposable super-simple <span></span><math>\n <semantics>\n <mrow>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mi>v</mi>\n <mo>,</mo>\n <mn>4</mn>\n <mo>,</mo>\n <mn>6</mn>\n </mrow>\n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation> $(v,4,6)$</annotation>\n </semantics></math>-BIBD (balanced incomplete block design) if and only if <span></span><math>\n <semantics>\n <mrow>\n <mi>v</mi>\n <mo>≥</mo>\n <mn>16</mn>\n </mrow>\n <annotation> $v\\ge 16$</annotation>\n </semantics></math> and <span></span><math>\n <semantics>\n <mrow>\n <mi>v</mi>\n <mo>≡</mo>\n <mn>1</mn>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mspace></mspace>\n <mi>mod</mi>\n <mspace></mspace>\n <mspace></mspace>\n <mn>3</mn>\n </mrow>\n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation> $v\\equiv 1(\\,\\mathrm{mod}\\,\\,3)$</annotation>\n </semantics></math>.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 6","pages":"297-307"},"PeriodicalIF":0.5000,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The existence of \\n \\n \\n \\n 2\\n 3\\n \\n \\n ${2}^{3}$\\n -decomposable super-simple \\n \\n \\n \\n (\\n \\n v\\n ,\\n 4\\n ,\\n 6\\n \\n )\\n \\n \\n $(v,4,6)$\\n -BIBDs\",\"authors\":\"Huangsheng Yu, Jingyuan Chen, R. Julian R. Abel, Dianhua Wu\",\"doi\":\"10.1002/jcd.21935\",\"DOIUrl\":null,\"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>\\n <semantics>\\n <mrow>\\n <mi>t</mi>\\n <mi>λ</mi>\\n </mrow>\\n <annotation> $t\\\\lambda $</annotation>\\n </semantics></math> is said to be <span></span><math>\\n <semantics>\\n <mrow>\\n <msup>\\n <mi>λ</mi>\\n <mi>t</mi>\\n </msup>\\n </mrow>\\n <annotation> ${\\\\lambda }^{t}$</annotation>\\n </semantics></math>-<i>decomposable</i>, if its blocks can be partitioned into nonempty collections <span></span><math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>B</mi>\\n <mi>i</mi>\\n </msub>\\n </mrow>\\n <annotation> ${{\\\\rm{ {\\\\mathcal B} }}}_{i}$</annotation>\\n </semantics></math>, <span></span><math>\\n <semantics>\\n <mrow>\\n <mn>1</mn>\\n <mo>≤</mo>\\n <mi>i</mi>\\n <mo>≤</mo>\\n <mi>t</mi>\\n </mrow>\\n <annotation> $1\\\\le i\\\\le t$</annotation>\\n </semantics></math>, such that each <span></span><math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>B</mi>\\n <mi>i</mi>\\n </msub>\\n </mrow>\\n <annotation> ${{\\\\rm{ {\\\\mathcal B} }}}_{i}$</annotation>\\n </semantics></math> with the point set forms a design with index <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>λ</mi>\\n </mrow>\\n <annotation> $\\\\lambda $</annotation>\\n </semantics></math>. In this paper, it is proved that there exists a <span></span><math>\\n <semantics>\\n <mrow>\\n <msup>\\n <mn>2</mn>\\n <mn>3</mn>\\n </msup>\\n </mrow>\\n <annotation> ${2}^{3}$</annotation>\\n </semantics></math>-decomposable super-simple <span></span><math>\\n <semantics>\\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mi>v</mi>\\n <mo>,</mo>\\n <mn>4</mn>\\n <mo>,</mo>\\n <mn>6</mn>\\n </mrow>\\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n <annotation> $(v,4,6)$</annotation>\\n </semantics></math>-BIBD (balanced incomplete block design) if and only if <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>v</mi>\\n <mo>≥</mo>\\n <mn>16</mn>\\n </mrow>\\n <annotation> $v\\\\ge 16$</annotation>\\n </semantics></math> and <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>v</mi>\\n <mo>≡</mo>\\n <mn>1</mn>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mspace></mspace>\\n <mi>mod</mi>\\n <mspace></mspace>\\n <mspace></mspace>\\n <mn>3</mn>\\n </mrow>\\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n <annotation> $v\\\\equiv 1(\\\\,\\\\mathrm{mod}\\\\,\\\\,3)$</annotation>\\n </semantics></math>.</p>\",\"PeriodicalId\":15389,\"journal\":{\"name\":\"Journal of Combinatorial Designs\",\"volume\":\"32 6\",\"pages\":\"297-307\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Designs\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21935\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Designs","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21935","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
The existence of
2
3
${2}^{3}$
-decomposable super-simple
(
v
,
4
,
6
)
$(v,4,6)$
-BIBDs
A design is said to be super-simple if the intersection of any two blocks has at most two elements. A design with index is said to be -decomposable, if its blocks can be partitioned into nonempty collections , , such that each with the point set forms a design with index . In this paper, it is proved that there exists a -decomposable super-simple -BIBD (balanced incomplete block design) if and only if and .
期刊介绍:
The Journal of Combinatorial Designs is an international journal devoted to the timely publication of the most influential papers in the area of combinatorial design theory. All topics in design theory, and in which design theory has important applications, are covered, including:
block designs, t-designs, pairwise balanced designs and group divisible designs
Latin squares, quasigroups, and related algebras
computational methods in design theory
construction methods
applications in computer science, experimental design theory, and coding theory
graph decompositions, factorizations, and design-theoretic techniques in graph theory and extremal combinatorics
finite geometry and its relation with design theory.
algebraic aspects of design theory.
Researchers and scientists can depend on the Journal of Combinatorial Designs for the most recent developments in this rapidly growing field, and to provide a forum for both theoretical research and applications. All papers appearing in the Journal of Combinatorial Designs are carefully peer refereed.