Extremal problems on the hypercube and the codegree Tur\'an density of complete $r$-graphs
Combinatorics
2018-11-29 v4 Group Theory
Abstract
Let be a finite abelian group, and be a multiple of its exponent. The generalized Erd\H{o}s-Ginzburg-Ziv constant is the smallest integer such that every sequence of length over has a zero-sum subsequence of length . We show that when , and when . We use results on to prove new bounds for the codegree Tur\'{a}n density of complete -graphs.
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