存在23个可分解的超简单(v,4,6)$(v,4,6)$-BIBDs

IF 0.5 4区 数学 Q3 MATHEMATICS Journal of Combinatorial Designs Pub Date : 2024-02-22 DOI:10.1002/jcd.21935
Huangsheng Yu, Jingyuan Chen, R. Julian R. Abel, Dianhua Wu
{"title":"存在23个可分解的超简单(v,4,6)$(v,4,6)$-BIBDs","authors":"Huangsheng Yu,&nbsp;Jingyuan Chen,&nbsp;R. Julian R. Abel,&nbsp;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,&nbsp;Jingyuan Chen,&nbsp;R. Julian R. Abel,&nbsp;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}
引用次数: 0

摘要

如果任意两个图块的交集最多只有两个元素,则称该设计为超简单设计。如果一个有索引的设计的图块可以被分割为非空集合 , , , 这样每个集合与点集构成一个有索引的设计,那么这个设计就被称为可分解设计。本文证明,当且仅当 和 时,存在一个可分解的超简单 -BIBD(平衡不完全块设计)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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 t λ $t\lambda $ is said to be λ t ${\lambda }^{t}$ -decomposable, if its blocks can be partitioned into nonempty collections B i ${{\rm{ {\mathcal B} }}}_{i}$ , 1 i t $1\le i\le t$ , such that each B i ${{\rm{ {\mathcal B} }}}_{i}$ with the point set forms a design with index λ $\lambda $ . In this paper, it is proved that there exists a 2 3 ${2}^{3}$ -decomposable super-simple ( v , 4 , 6 ) $(v,4,6)$ -BIBD (balanced incomplete block design) if and only if v 16 $v\ge 16$ and v 1 ( mod 3 ) $v\equiv 1(\,\mathrm{mod}\,\,3)$ .

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
期刊最新文献
Issue Information Issue Information Completely reducible super-simple ( v , 4 , 4 ) $(v,4,4)$ -BIBDs and related constant weight codes Characterising ovoidal cones by their hyperplane intersection numbers Partitioning the projective plane into two incidence-rich parts
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1