{"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":"112 15","pages":"0"},"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\":\"112 15\",\"pages\":\"0\"},\"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}
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.