Infinite Sperner's theorem

2020/08/11 by Benny Sudakov, Sudakov, Benny, István Tomon +3
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.2008.04804

9 pages, 1 figure. Dömötör Pálvölgyi brought to our attention that Kraft's inequality for prefix codes can be used to simplify our argument for the upper bound

arxiv created 2020/08/13 · arxiv updated 2020/08/14

Abstract

One of the most classical results in extremal set theory is Sperner's theorem, which says that the largest antichain in the Boolean lattice 2^[n] has size Θ((2ⁿ)/(√(n))). Motivated by an old problem of Erdős on the growth of infinite Sidon sequences, in this note we study the growth rate of maximum infinite antichains. Using the well known Kraft's inequality for prefix codes, it is not difficult to show that infinite antichains should be "thinner" than the corresponding finite ones. More precisely, if F⊂ 2^ℕ is an antichain, then \liminf_{n→ ∞}|F ∩ 2^[n]|((2ⁿ)/(nlog n))^-1=0. Our main result shows that this bound is essentially tight, that is, we construct an antichain F such that \liminf_{n→ ∞}|F ∩ 2^[n]|(\frac2ⁿnlog^C n)^-1>0 holds for some absolute constant C>0.

Related

• A sharp threshold for a random version of Sperner's Theorem
• Sperner's Theorem and a Problem of Erdos-Katona-Kleitman
• On Dedekind's problem, a sparse version of Sperner's theorem, and antichains of a given size in the Boolean lattice
• Saturation of k-chains in the Boolean lattice
• Sperner's problem for G-independent families