关于彩票号码的渐近性

Sidorenko, Alexander
{"title":"关于彩票号码的渐近性","authors":"Sidorenko, Alexander","doi":"10.48550/arxiv.2311.07406","DOIUrl":null,"url":null,"abstract":"Let $L(n,k,r,p)$ denote the minimum number of $k$-subsets of an $n$-set such that all the $\\binom{n}{p}$ $p$-subsets are intersected by one of them in at least $r$ elements. The case $p=r$ corresponds to the covering numbers, while the case $k=r$ corresponds to the Tur\\'an numbers. In both cases, there exists a limit of $L(n,k,r,p) / \\binom{n}{r}$ as $n\\to\\infty$. We prove the existence of this limit in the general case.","PeriodicalId":496270,"journal":{"name":"arXiv (Cornell University)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the asymptotic of lottery numbers\",\"authors\":\"Sidorenko, Alexander\",\"doi\":\"10.48550/arxiv.2311.07406\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let $L(n,k,r,p)$ denote the minimum number of $k$-subsets of an $n$-set such that all the $\\\\binom{n}{p}$ $p$-subsets are intersected by one of them in at least $r$ elements. The case $p=r$ corresponds to the covering numbers, while the case $k=r$ corresponds to the Tur\\\\'an numbers. In both cases, there exists a limit of $L(n,k,r,p) / \\\\binom{n}{r}$ as $n\\\\to\\\\infty$. We prove the existence of this limit in the general case.\",\"PeriodicalId\":496270,\"journal\":{\"name\":\"arXiv (Cornell University)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv (Cornell University)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arxiv.2311.07406\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv (Cornell University)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arxiv.2311.07406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

设$L(n,k,r,p)$表示一个$n$ -集合的$k$ -子集的最小数量,使得所有的$\binom{n}{p}$ - $p$ -子集在至少$r$个元素中被其中一个相交。案例$p=r$对应于覆盖号,而案例$k=r$对应于Turán号。在这两种情况下,都存在$L(n,k,r,p) / \binom{n}{r}$和$n\to\infty$的限制。我们在一般情况下证明了这个极限的存在性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the asymptotic of lottery numbers
Let $L(n,k,r,p)$ denote the minimum number of $k$-subsets of an $n$-set such that all the $\binom{n}{p}$ $p$-subsets are intersected by one of them in at least $r$ elements. The case $p=r$ corresponds to the covering numbers, while the case $k=r$ corresponds to the Tur\'an numbers. In both cases, there exists a limit of $L(n,k,r,p) / \binom{n}{r}$ as $n\to\infty$. We prove the existence of this limit in the general case.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信