Extremal problems on the hypercube and the codegree Tur\'an density of complete r-graphs
Abstract
Let G be a finite abelian group, and r be a multiple of its exponent. The generalized Erdos-Ginzburg-Ziv constant sr(G) is the smallest integer s such that every sequence of length s over G has a zero-sum subsequence of length r. We show that s2m(Z2d) ≤ Cm 2d/m + O(1) when d→∞, and s2m(Z2d) ≥ 2d/m + 2m-1 when d=km. We use results on sr(G) to prove new bounds for the codegree Tur\'an density of complete r-graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.