English

Extremal problems on the hypercube and the codegree Tur\'an density of complete $r$-graphs

Combinatorics 2018-11-29 v4 Group Theory

Abstract

Let GG be a finite abelian group, and rr be a multiple of its exponent. The generalized Erd\H{o}s-Ginzburg-Ziv constant sr(G)s_r(G) is the smallest integer ss such that every sequence of length ss over GG has a zero-sum subsequence of length rr. We show that s2m(Z2d)Cm2d/m+O(1)s_{2m}(\mathbb{Z}_2^d) \leq C_m 2^{d/m} + O(1) when dd\rightarrow\infty, and s2m(Z2d)2d/m+2m1s_{2m}(\mathbb{Z}_2^d) \geq 2^{d/m} + 2m-1 when d=kmd=km. We use results on sr(G)s_r(G) to prove new bounds for the codegree Tur\'{a}n density of complete rr-graphs.

Keywords

Cite

@article{arxiv.1710.08228,
  title  = {Extremal problems on the hypercube and the codegree Tur\'an density of complete $r$-graphs},
  author = {Alexander Sidorenko},
  journal= {arXiv preprint arXiv:1710.08228},
  year   = {2018}
}

Comments

Changes made in response to the referee's suggestions

R2 v1 2026-06-22T22:22:35.255Z