λ=3的所有λ-设计的测定

William G. Bridges Jr. , Earl S. Kramer
{"title":"λ=3的所有λ-设计的测定","authors":"William G. Bridges Jr. ,&nbsp;Earl S. Kramer","doi":"10.1016/S0021-9800(70)80029-1","DOIUrl":null,"url":null,"abstract":"<div><p>Let <em>S</em><sub>1</sub>, …, <em>S<sub>n</sub></em>, <em>n</em>&gt;1, be subsets of an <em>n</em>-set <em>S</em> where |<em>S<sub>i</sub></em>|&gt;λ≥1 and |<em>S<sub>i</sub></em>∩<em>S<sub>j</sub></em>|=λ for <em>i≠j</em>. Then our configuration is either a symmetric block design, with possible degeneracies, or what Ryser [3] has called a λ-design. A λ-design has the remarkable property, established by Ryser [3], that each element of <em>S</em> occurs either <em>r</em><sub>1</sub> or <em>r</em><sub>2</sub> times among the sets <em>S<sub>i</sub></em>, …, <em>S<sub>n</sub></em> and <em>r<sub>1</sub>+r<sub>2</sub>=n+1</em>. The 1-designs are completely known and so is the unique 2-design. The present paper establishes that there are exactly three 3-designs.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"8 4","pages":"Pages 343-349"},"PeriodicalIF":0.0000,"publicationDate":"1970-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80029-1","citationCount":"15","resultStr":"{\"title\":\"The determination of all λ-designs with λ=3\",\"authors\":\"William G. Bridges Jr. ,&nbsp;Earl S. Kramer\",\"doi\":\"10.1016/S0021-9800(70)80029-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Let <em>S</em><sub>1</sub>, …, <em>S<sub>n</sub></em>, <em>n</em>&gt;1, be subsets of an <em>n</em>-set <em>S</em> where |<em>S<sub>i</sub></em>|&gt;λ≥1 and |<em>S<sub>i</sub></em>∩<em>S<sub>j</sub></em>|=λ for <em>i≠j</em>. Then our configuration is either a symmetric block design, with possible degeneracies, or what Ryser [3] has called a λ-design. A λ-design has the remarkable property, established by Ryser [3], that each element of <em>S</em> occurs either <em>r</em><sub>1</sub> or <em>r</em><sub>2</sub> times among the sets <em>S<sub>i</sub></em>, …, <em>S<sub>n</sub></em> and <em>r<sub>1</sub>+r<sub>2</sub>=n+1</em>. The 1-designs are completely known and so is the unique 2-design. The present paper establishes that there are exactly three 3-designs.</p></div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"8 4\",\"pages\":\"Pages 343-349\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1970-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80029-1\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980070800291\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800291","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

设S1,…,Sn, n>1是n-集合S的子集,其中|Si|>λ≥1,且对于i≠j, |Si∩Sj|=λ。那么我们的构型要么是一个对称块设计,可能有简并,要么是Ryser[3]所说的λ-设计。由Ryser[3]建立的λ-设计具有显著的性质,即S的每个元素在集合Si,…,Sn和r1+r2=n+1中出现r1或r2次。1号设计是完全已知的,所以是独特的2号设计。本文确定了三种3-设计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The determination of all λ-designs with λ=3

Let S1, …, Sn, n>1, be subsets of an n-set S where |Si|>λ≥1 and |SiSj|=λ for i≠j. Then our configuration is either a symmetric block design, with possible degeneracies, or what Ryser [3] has called a λ-design. A λ-design has the remarkable property, established by Ryser [3], that each element of S occurs either r1 or r2 times among the sets Si, …, Sn and r1+r2=n+1. The 1-designs are completely known and so is the unique 2-design. The present paper establishes that there are exactly three 3-designs.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Announcement A rank inequality for finite geometric lattices On the factorisation of the complete graph into factors of diameter 2 On nonreconstructable tournaments The number of classes of isomorphic graded partially ordered sets
×
引用
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