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 we work in , several analogous statements hold if one replaces the word -chain by projective cube of dimension . We say that is a projective cube of dimension if there are numbers 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 is a power of two, the largest -cube free set in is the union of the largest layers. As an analog of Kleitman's theorem, Samotij and Sudakov asked whether among subsets of of given size , 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 , and conjecture that the analog of Samotij's theorem also holds. Several open questions and conjectures are also given.
Recommendations
Cites work
- scientific article; zbMATH DE number 3823861 (Why is no real title available?)
- scientific article; zbMATH DE number 3456942 (Why is no real title available?)
- scientific article; zbMATH DE number 3256524 (Why is no real title available?)
- Extremal Problems for Affine Cubes of Integers
- Monochromatic Hilbert cubes and arithmetic progressions
- On a lemma of Littlewood and Offord
- On saturated \(k\)-Sperner systems
- On sums of subsets of a set of integers
- On two additive problems
- Saturating Sperner families
- Studien zur Kombinatorik
- Subset sums
- Subsets of posets minimising the number of chains
- The maximum number of disjoint pairs in a family of subsets
- The number of additive triples in subsets of abelian groups
Cited in
(2)
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)