The largest projective cube-free subsets of Z₂^n

From MaRDI portal
Publication:2323091




Abstract: In the Boolean lattice, Sperner's, ErdH{o}s's, Kleitman's and Samotij's theorems state that families that do not contain many chains must have a very specific layered structure. We show that if instead of mathbbZ2n we work in mathbbZ2n, several analogous statements hold if one replaces the word k-chain by projective cube of dimension 2k1. We say that Bd is a projective cube of dimension d if there are numbers a1,a2,ldots,ad such that B_d = left{sum_{iin I} a_i �igg vert emptyset eq Isubseteq [d] ight}. As an analog of Sperner's and ErdH{o}s's theorems, we show that whenever d=2ell is a power of two, the largest d-cube free set in mathbbZ2n is the union of the largest ell layers. As an analog of Kleitman's theorem, Samotij and Sudakov asked whether among subsets of mathbbZ2n of given size M, the sets that minimize the number of Schur triples (2-cubes) are those that are obtained by filling up the largest layers consecutively. We prove the first non-trivial case where M=2n1+1, and conjecture that the analog of Samotij's theorem also holds. Several open questions and conjectures are also given.





Describes a project that uses

Uses Software





This page was built for publication: The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2323091)