下载PDF
{"title":"块大小为 4 的 BIBD 嵌套","authors":"Marco Buratti, Donald L. Kreher, Douglas R. Stinson","doi":"10.1002/jcd.21957","DOIUrl":null,"url":null,"abstract":"<p>In a nesting of a balanced incomplete block design (or BIBD), we wish to add a point (the <i>nested point</i>) to every block of a <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>v</mi>\n \n <mo>,</mo>\n \n <mi>k</mi>\n \n <mo>,</mo>\n \n <mi>λ</mi>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n <annotation> $(v,k,\\lambda )$</annotation>\n </semantics></math>-BIBD in such a way that we end up with a partial <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>v</mi>\n \n <mo>,</mo>\n \n <mi>k</mi>\n \n <mo>+</mo>\n \n <mn>1</mn>\n \n <mo>,</mo>\n \n <mi>λ</mi>\n \n <mo>+</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n <annotation> $(v,k+1,\\lambda +1)$</annotation>\n </semantics></math>-BIBD. In the case where the partial <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>v</mi>\n \n <mo>,</mo>\n \n <mi>k</mi>\n \n <mo>+</mo>\n \n <mn>1</mn>\n \n <mo>,</mo>\n \n <mi>λ</mi>\n \n <mo>+</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n <annotation> $(v,k+1,\\lambda +1)$</annotation>\n </semantics></math>-BIBD is in fact a <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>v</mi>\n \n <mo>,</mo>\n \n <mi>k</mi>\n \n <mo>+</mo>\n \n <mn>1</mn>\n \n <mo>,</mo>\n \n <mi>λ</mi>\n \n <mo>+</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n <annotation> $(v,k+1,\\lambda +1)$</annotation>\n </semantics></math>-BIBD, we have a <i>perfect nesting</i>. We show that a nesting is perfect if and only if <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>k</mi>\n \n <mo>=</mo>\n \n <mn>2</mn>\n \n <mi>λ</mi>\n \n <mo>+</mo>\n \n <mn>1</mn>\n </mrow>\n </mrow>\n <annotation> $k=2\\lambda +1$</annotation>\n </semantics></math>. Perfect nestings were previously known to exist in the case of Steiner triple systems (i.e., <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>v</mi>\n \n <mo>,</mo>\n \n <mn>3</mn>\n \n <mo>,</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n <annotation> $(v,3,1)$</annotation>\n </semantics></math>-BIBDs) when <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>v</mi>\n \n <mo>≡</mo>\n \n <mn>1</mn>\n <mspace></mspace>\n \n <mi>mod</mi>\n <mspace></mspace>\n \n <mn>6</mn>\n </mrow>\n </mrow>\n <annotation> $v\\equiv 1\\,\\mathrm{mod}\\,6$</annotation>\n </semantics></math>, as well as for some symmetric BIBDs. Here we study nestings of <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>v</mi>\n \n <mo>,</mo>\n \n <mn>4</mn>\n \n <mo>,</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n <annotation> $(v,4,1)$</annotation>\n </semantics></math>-BIBDs, which are not perfect nestings. We prove that there is a nested <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>v</mi>\n \n <mo>,</mo>\n \n <mn>4</mn>\n \n <mo>,</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n <annotation> $(v,4,1)$</annotation>\n </semantics></math>-BIBD if and only if <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>v</mi>\n \n <mo>≡</mo>\n \n <mn>1</mn>\n \n <mstyle>\n <mspace></mspace>\n \n <mtext>or</mtext>\n <mspace></mspace>\n </mstyle>\n \n <mn>4</mn>\n <mspace></mspace>\n \n <mi>mod</mi>\n <mspace></mspace>\n \n <mn>12</mn>\n </mrow>\n </mrow>\n <annotation> $v\\equiv 1\\,\\text{or}\\,4\\,\\mathrm{mod}\\,12$</annotation>\n </semantics></math>, <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>v</mi>\n \n <mo>≥</mo>\n \n <mn>13</mn>\n </mrow>\n </mrow>\n <annotation> $v\\ge 13$</annotation>\n </semantics></math>. This is accomplished by a variety of direct and recursive constructions.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 12","pages":"715-743"},"PeriodicalIF":0.5000,"publicationDate":"2024-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21957","citationCount":"0","resultStr":"{\"title\":\"Nestings of BIBDs with block size four\",\"authors\":\"Marco Buratti, Donald L. Kreher, Douglas R. Stinson\",\"doi\":\"10.1002/jcd.21957\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In a nesting of a balanced incomplete block design (or BIBD), we wish to add a point (the <i>nested point</i>) to every block of a <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>v</mi>\\n \\n <mo>,</mo>\\n \\n <mi>k</mi>\\n \\n <mo>,</mo>\\n \\n <mi>λ</mi>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n <annotation> $(v,k,\\\\lambda )$</annotation>\\n </semantics></math>-BIBD in such a way that we end up with a partial <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>v</mi>\\n \\n <mo>,</mo>\\n \\n <mi>k</mi>\\n \\n <mo>+</mo>\\n \\n <mn>1</mn>\\n \\n <mo>,</mo>\\n \\n <mi>λ</mi>\\n \\n <mo>+</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n <annotation> $(v,k+1,\\\\lambda +1)$</annotation>\\n </semantics></math>-BIBD. In the case where the partial <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>v</mi>\\n \\n <mo>,</mo>\\n \\n <mi>k</mi>\\n \\n <mo>+</mo>\\n \\n <mn>1</mn>\\n \\n <mo>,</mo>\\n \\n <mi>λ</mi>\\n \\n <mo>+</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n <annotation> $(v,k+1,\\\\lambda +1)$</annotation>\\n </semantics></math>-BIBD is in fact a <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>v</mi>\\n \\n <mo>,</mo>\\n \\n <mi>k</mi>\\n \\n <mo>+</mo>\\n \\n <mn>1</mn>\\n \\n <mo>,</mo>\\n \\n <mi>λ</mi>\\n \\n <mo>+</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n <annotation> $(v,k+1,\\\\lambda +1)$</annotation>\\n </semantics></math>-BIBD, we have a <i>perfect nesting</i>. We show that a nesting is perfect if and only if <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>k</mi>\\n \\n <mo>=</mo>\\n \\n <mn>2</mn>\\n \\n <mi>λ</mi>\\n \\n <mo>+</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n </mrow>\\n <annotation> $k=2\\\\lambda +1$</annotation>\\n </semantics></math>. Perfect nestings were previously known to exist in the case of Steiner triple systems (i.e., <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>v</mi>\\n \\n <mo>,</mo>\\n \\n <mn>3</mn>\\n \\n <mo>,</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n <annotation> $(v,3,1)$</annotation>\\n </semantics></math>-BIBDs) when <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>v</mi>\\n \\n <mo>≡</mo>\\n \\n <mn>1</mn>\\n <mspace></mspace>\\n \\n <mi>mod</mi>\\n <mspace></mspace>\\n \\n <mn>6</mn>\\n </mrow>\\n </mrow>\\n <annotation> $v\\\\equiv 1\\\\,\\\\mathrm{mod}\\\\,6$</annotation>\\n </semantics></math>, as well as for some symmetric BIBDs. Here we study nestings of <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>v</mi>\\n \\n <mo>,</mo>\\n \\n <mn>4</mn>\\n \\n <mo>,</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n <annotation> $(v,4,1)$</annotation>\\n </semantics></math>-BIBDs, which are not perfect nestings. We prove that there is a nested <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>v</mi>\\n \\n <mo>,</mo>\\n \\n <mn>4</mn>\\n \\n <mo>,</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n <annotation> $(v,4,1)$</annotation>\\n </semantics></math>-BIBD if and only if <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>v</mi>\\n \\n <mo>≡</mo>\\n \\n <mn>1</mn>\\n \\n <mstyle>\\n <mspace></mspace>\\n \\n <mtext>or</mtext>\\n <mspace></mspace>\\n </mstyle>\\n \\n <mn>4</mn>\\n <mspace></mspace>\\n \\n <mi>mod</mi>\\n <mspace></mspace>\\n \\n <mn>12</mn>\\n </mrow>\\n </mrow>\\n <annotation> $v\\\\equiv 1\\\\,\\\\text{or}\\\\,4\\\\,\\\\mathrm{mod}\\\\,12$</annotation>\\n </semantics></math>, <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>v</mi>\\n \\n <mo>≥</mo>\\n \\n <mn>13</mn>\\n </mrow>\\n </mrow>\\n <annotation> $v\\\\ge 13$</annotation>\\n </semantics></math>. This is accomplished by a variety of direct and recursive constructions.</p>\",\"PeriodicalId\":15389,\"journal\":{\"name\":\"Journal of Combinatorial Designs\",\"volume\":\"32 12\",\"pages\":\"715-743\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21957\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Designs\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21957\",\"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.21957","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
引用
批量引用