谷歌浏览器插件
订阅小程序
在清言上使用

A Note on Infinite Antichain Density

SIAM journal on discrete mathematics(2022)

引用 1|浏览11
暂无评分
摘要
Let F be an antichain of finite subsets of N. How quickly can the quantities vertical bar F boolean AND 2([n])vertical bar grow as n -> infinity? We show that for any sequence (f(n))(n >= n0) of positive integers satisfying Sigma(infinity)(n=n0)f(n)/2(n) <= 1/4 and f(n) <= f(n+1) <= 2f(n), there exists an infinite antichain F of finite subsets of N such that vertical bar F boolean AND 2([n])vertical bar >= f(n) for all n >= n(0). It follows that for any epsilon > 0 there exists an antichain F subset of 2(N) such that lim inf(n ->infinity) vertical bar F boolean AND 2([n])vertical bar . (2(n)/n log1+epsilon n)(-1) > 0. This resolves a problem of Sudakov, Tomon, and Wagner in a strong form and is essentially tight.
更多
查看译文
关键词
infinite antichains,Sperner's theorem,prefix codes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要