On a conjecture on k-antichains in the unit n-cube

Abstract

Let [0, 1]n ⊂eq Rn be endowed with its pointwise order, and let k be a positive integer. A subset A of [0, 1]n is said to be a k-antichain if card(A C) ≤ k for each chain C ⊂eq [0, 1]n. Letting Hm denote the m-dimensional Hausdorff outer measure, Pelekis and Vlasák [Publ.\ Math.\ Debrecen, 2020] conjectured that there exists a k-antichain A ⊂eq [0, 1]n satisfying Hn-1(A) = k n, and proved the special case of this conjecture for n = 2, whereas Janzer [Mathematika, 2020] proved the k = 1 case of Pelekis and Vlasák's conjecture. This conjecture is motivated by a result due to Erdős on k-antichains in \ 0, 1 \n. We prove Pelekis and Vlasák's conjecture in full generality, thus establishing that their upper bound Hn-1(A) ≤ k n is sharp for k-antichains A in [0, 1]n.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…