Bounds on the higher degree Erdős-Ginzburg-Ziv constants over \({\mathbb{F}}_q^n\)
From MaRDI portal
Publication:6189006
DOI10.1007/s00013-023-01916-4arXiv2211.03682OpenAlexW4387422667MaRDI QIDQ6189006
Stefano Della Fiore, Simone Costa
Publication date: 12 January 2024
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.03682
Other combinatorial number theory (11B75) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- Zero-sum problems in finite Abelian groups: a survey
- Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions
- Zero-sum subsequences in Abelian non-cyclic groups
- A combinatorial problem on finite abelian groups
- Zero-sum problems -- a survey
- A gap in the slice rank of \(k\)-tensors
- Exponential lower bounds on the generalized Erdős-Ginzburg-Ziv constant
- On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero
- Exponential bounds for the Erdős-Ginzburg-Ziv constant
- Cubic symmetric polynomials yielding variations of the Erdős-Ginzburg-Ziv theorem
- Remarks on a zero-sum theorem
- Higher Degree Davenport Constants over Finite Commutative Rings
- An Analogue of the Erdős–Ginzburg–Ziv Theorem for Quadratic Symmetric Polynomials
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- UPPER BOUNDS FOR SUNFLOWER-FREE SETS
This page was built for publication: Bounds on the higher degree Erdős-Ginzburg-Ziv constants over \({\mathbb{F}}_q^n\)
