Higher Degree Erdos-Ginzburg-Ziv Constants
Yair Caro, John R. Schmitt

TL;DR
This paper extends Erdős-Ginzburg-Ziv constants to a higher degree setting, providing bounds and exact values for certain finite rings, and explores how symmetric polynomial expressions vanish on long sequences.
Contribution
It introduces a higher degree generalization of Erdős-Ginzburg-Ziv constants, derives bounds, and examines their relation to existing theorems, with exact results for specific finite rings.
Findings
Bounds for higher degree Erdős-Ginzburg-Ziv constants are established.
Exact values obtained for certain finite commutative rings of prime power size.
Sequences of sufficient length guarantee vanishing symmetric polynomial expressions.
Abstract
We generalize the notion of Erd\H{o}s-Ginzburg-Ziv constants -- along the same lines we generalized in earlier work the notion of Davenport constants -- to a ``higher degree" and obtain various lower and upper bounds. These bounds are sometimes exact as is the case for certain finite commutative rings of prime power cardinality. We also consider to what extent a theorem due independently to W.D.~Gao and the first author that relates these two parameters extends to this higher degree setting. Two simple examples that capture the essence of these higher degree Erd\H{o}s-Ginzburg-Ziv constants are the following. 1) Let denote the adic valuation of the integer . Suppose we have integers and , then every sequence over of length contains a subsequence of length for which $\sum_{a_{i_1},\ldots,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Coding theory and cryptography · Algebraic Geometry and Number Theory
