块大小为 4 的 BIBD 嵌套

IF 0.5 4区 数学 Q3 MATHEMATICS
Marco Buratti, Donald L. Kreher, Douglas R. Stinson
{"title":"块大小为 4 的 BIBD 嵌套","authors":"Marco Buratti,&nbsp;Donald L. Kreher,&nbsp;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,&nbsp;Donald L. Kreher,&nbsp;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

摘要

在平衡不完全区块设计(或 BIBD)的嵌套中,我们希望在 ( v , k , λ ) $(v,k,\lambda )$ -BIBD 的每个区块中添加一个点(嵌套点),这样我们最终会得到一个部分 ( v , k + 1 , λ + 1 ) $(v,k+1,\lambda +1)$ -BIBD 。在部分 ( v , k + 1 , λ + 1 ) $(v,k+1,\lambda +1)$ -BIBD 实际上是 ( v , k + 1 , λ + 1 ) $(v,k+1,\lambda +1)$ -BIBD 的情况下,我们有一个完美嵌套。我们证明,当且仅当 k = 2 λ + 1 $k=2\lambda +1$ 时,嵌套是完美的。完美嵌套以前已知存在于斯坦纳三重系统中(即
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Nestings of BIBDs with block size four

In a nesting of a balanced incomplete block design (or BIBD), we wish to add a point (the nested point) to every block of a ( v , k , λ ) $(v,k,\lambda )$ -BIBD in such a way that we end up with a partial ( v , k + 1 , λ + 1 ) $(v,k+1,\lambda +1)$ -BIBD. In the case where the partial ( v , k + 1 , λ + 1 ) $(v,k+1,\lambda +1)$ -BIBD is in fact a ( v , k + 1 , λ + 1 ) $(v,k+1,\lambda +1)$ -BIBD, we have a perfect nesting. We show that a nesting is perfect if and only if k = 2 λ + 1 $k=2\lambda +1$ . Perfect nestings were previously known to exist in the case of Steiner triple systems (i.e., ( v , 3 , 1 ) $(v,3,1)$ -BIBDs) when v 1 mod 6 $v\equiv 1\,\mathrm{mod}\,6$ , as well as for some symmetric BIBDs. Here we study nestings of ( v , 4 , 1 ) $(v,4,1)$ -BIBDs, which are not perfect nestings. We prove that there is a nested ( v , 4 , 1 ) $(v,4,1)$ -BIBD if and only if v 1 or 4 mod 12 $v\equiv 1\,\text{or}\,4\,\mathrm{mod}\,12$ , v 13 $v\ge 13$ . This is accomplished by a variety of direct and recursive constructions.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.60
自引率
14.30%
发文量
55
审稿时长
>12 weeks
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信