集合具有不同集合的系统

Q2 Mathematics
Javier Cilleruelo , Oriol Serra , Maximilian Wötzel
{"title":"集合具有不同集合的系统","authors":"Javier Cilleruelo ,&nbsp;Oriol Serra ,&nbsp;Maximilian Wötzel","doi":"10.1016/j.endm.2018.06.004","DOIUrl":null,"url":null,"abstract":"<div><p>A family <span><math><mi>A</mi></math></span> of <em>k</em>-subsets of <span><math><mo>{</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>N</mi><mo>}</mo></math></span> is a Sidon system if the sumsets <span><math><mi>A</mi><mo>+</mo><msup><mrow><mi>A</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>,</mo><mi>A</mi><mo>,</mo><msup><mrow><mi>A</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>∈</mo><mi>A</mi></math></span> are pairwise distinct. We show that the largest cardinality <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>N</mi><mo>)</mo></math></span> of a Sidon system of <em>k</em>-subsets of <span><math><mo>[</mo><mi>N</mi><mo>]</mo></math></span> satisfies <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>N</mi><mo>)</mo><mo>≤</mo><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mi>N</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr><mtr><mtd><mrow><mi>k</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr></mtable><mo>)</mo></mrow><mo>+</mo><mi>N</mi><mo>−</mo><mi>k</mi></math></span> and the asymptotic lower bound <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>N</mi><mo>)</mo><mo>=</mo><msub><mrow><mi>Ω</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><msup><mrow><mi>N</mi></mrow><mrow><mi>k</mi><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></math></span>. More precise bounds on <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>N</mi><mo>)</mo></math></span> are obtained for <span><math><mi>k</mi><mo>≤</mo><mn>3</mn></math></span>. We also obtain the threshold probability for a random system to be Sidon for <span><math><mi>k</mi><mo>=</mo><mn>2</mn></math></span> and 3.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.004","citationCount":"0","resultStr":"{\"title\":\"Set systems with distinct sumsets\",\"authors\":\"Javier Cilleruelo ,&nbsp;Oriol Serra ,&nbsp;Maximilian Wötzel\",\"doi\":\"10.1016/j.endm.2018.06.004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A family <span><math><mi>A</mi></math></span> of <em>k</em>-subsets of <span><math><mo>{</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>N</mi><mo>}</mo></math></span> is a Sidon system if the sumsets <span><math><mi>A</mi><mo>+</mo><msup><mrow><mi>A</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>,</mo><mi>A</mi><mo>,</mo><msup><mrow><mi>A</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>∈</mo><mi>A</mi></math></span> are pairwise distinct. We show that the largest cardinality <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>N</mi><mo>)</mo></math></span> of a Sidon system of <em>k</em>-subsets of <span><math><mo>[</mo><mi>N</mi><mo>]</mo></math></span> satisfies <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>N</mi><mo>)</mo><mo>≤</mo><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mi>N</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr><mtr><mtd><mrow><mi>k</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr></mtable><mo>)</mo></mrow><mo>+</mo><mi>N</mi><mo>−</mo><mi>k</mi></math></span> and the asymptotic lower bound <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>N</mi><mo>)</mo><mo>=</mo><msub><mrow><mi>Ω</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><msup><mrow><mi>N</mi></mrow><mrow><mi>k</mi><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></math></span>. More precise bounds on <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>N</mi><mo>)</mo></math></span> are obtained for <span><math><mi>k</mi><mo>≤</mo><mn>3</mn></math></span>. We also obtain the threshold probability for a random system to be Sidon for <span><math><mi>k</mi><mo>=</mo><mn>2</mn></math></span> and 3.</p></div>\",\"PeriodicalId\":35408,\"journal\":{\"name\":\"Electronic Notes in Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.004\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571065318300957\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318300957","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

摘要

如果集合A+A ',A,A '∈A是两两不同的,则由{1,2,…,N}的k个子集组成的族A是一个西顿系统。证明了由[N]的k个子集组成的Sidon系统的最大基数Fk(N)满足Fk(N)≤(N−1k−1)+N−k,且其渐近下界Fk(N)=Ωk(Nk−1)。当k≤3时,得到了Fk(N)上更精确的界。我们还得到了k=2和3时随机系统为Sidon的阈值概率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Set systems with distinct sumsets

A family A of k-subsets of {1,2,,N} is a Sidon system if the sumsets A+A,A,AA are pairwise distinct. We show that the largest cardinality Fk(N) of a Sidon system of k-subsets of [N] satisfies Fk(N)(N1k1)+Nk and the asymptotic lower bound Fk(N)=Ωk(Nk1). More precise bounds on Fk(N) are obtained for k3. We also obtain the threshold probability for a random system to be Sidon for k=2 and 3.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Electronic Notes in Discrete Mathematics
Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics
CiteScore
1.30
自引率
0.00%
发文量
0
期刊介绍: Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
×
引用
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学术官方微信