Iterated sumsets and setpartitions

DOI10.1007/S11139-019-00155-YzbMATH Open1477.11018OpenAlexW2964780137WikidataQ127435213 ScholiaQ127435213MaRDI QIDQ780438FDOQ780438

Authors David J. Grynkiewicz

Publication date 15 July 2020

Published in The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1709.09288

zbMATH Keywords

Kneser's theoremzero-sumsumsetpartition theoremDeVos-Goddyn-Mohar theoremsubsequence sumsubsum

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13)

Abstract: Let $GcongmathbbZ/m_{1}mathbbZimesldotsimesmathbbZ/m_{r}mathbbZ$ be a finite abelian group with $m_{1}midldotsmid{m}_r=exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar Theorem or the Partition Theorem, has become a powerful tool used to prove numerous zero-sum and subsequence sum questions. It provides a structural description of sequences having a small number of $n$-term subsequence sums, ensuring this is only possible if most terms of the sequence are contained in a small number of $H$-cosets. For large $ngeqfrac1p|G|-1$ or $ngeqfrac1p|G|+p-3$, where $p$ is the smallest prime divisor of $|G|$, the structural description is particularly strong. In particular, most terms of the sequence become contained in a single $H$-coset, with additional properties holding regarding the representation of elements of $G$ as subsequence sums. This strengthened form of the subsums version of Kneser's Theorem was later to shown to hold under the weaker hypothesis $ngeqmathsf{d}^{\ast }(G)$, where $mathsf{d}^{\ast }(G)=su{m}_{i=1}^r(m_i-1)$. In this paper, we reduce the restriction on $n$ even further to an optimal, best-possible value, showing we need only assume $ngeqexp(G)+1$ to obtain the same conclusions, with the bound further improved for several classes of near-cyclic groups.

Recommendations

• Iterated sumsets and subsequence sums
• Iterated sumsets and Olson's generalization of the Erdős-Ginzburg-Ziv theorem
• Representing sequence subsums as sumsets of near equal sized sets
• scientific article; zbMATH DE number 5014481
• On a partition analog of the Cauchy-Davenport Theorem

Cites work

• scientific article; zbMATH DE number 426326 (Why is no real title available?)
• scientific article; zbMATH DE number 5014481 (Why is no real title available?)
• scientific article; zbMATH DE number 3675978 (Why is no real title available?)
• scientific article; zbMATH DE number 3544151 (Why is no real title available?)
• scientific article; zbMATH DE number 524125 (Why is no real title available?)
• scientific article; zbMATH DE number 2066195 (Why is no real title available?)
• scientific article; zbMATH DE number 933467 (Why is no real title available?)
• scientific article; zbMATH DE number 3102822 (Why is no real title available?)
• A generalization of Kneser's addition theorem
• A simple proof of a theorem of Bollobás and Leader
• A weighted Erdős-Ginzburg-Ziv theorem
• A weighted generalization of two theorems of Gao
• Addition theorems for finite abelian groups
• Addition theorems on the cyclic groups of order \(p^\ell\).
• Additive combinatorics
• An addition theorem for finite abelian groups
• An addition theorem on the cyclic group \({\mathbb Z}_{p^\alpha q^\beta}\)
• An extension of the Erdős-Ginzburg-Ziv theorem to hypergraphs
• Combinatorial number theory and additive group theory. With a foreword by Javier Cilleruelo, Marc Noy and Oriol Serra (Coordinators of the DocCourse)
• Distinct length modular zero-sum subsequences: a proof of Graham's conjecture
• Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
• Inverse zero-sum problems. III.
• Iterated sumsets and subsequence sums
• Monochromatic and zero-sum sets of nondecreasing diameter
• Monochromatic and zero-sum sets of nondecreasing modified diameter
• Non-unique factorizations. Algebraic, combinatorial and analytic theory
• Note on a conjecture of Graham
• On Erdős–Ginzburg–Ziv inverse theorems
• On a Combinatorial Theorem of Erdös, Ginzburg and Ziv
• On a partition analog of the Cauchy-Davenport Theorem
• On four colored sets with nondecreasing diameter and the Erdős-Ginzburg-Ziv theorem
• On some developments of the Erdős–Ginzburg–Ziv Theorem II
• On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings
• On the Olson and the strong Davenport constants
• On the number of m-term zero-sum subsequences
• On the structure of long zero-sum free sequences and \(n\)-zero-sum free sequences over finite cyclic groups
• Onn-Sums in an Abelian Group
• Representation of finite abelian group elements by subsequence sums
• The large Davenport constant. I: Groups with a cyclic, index 2 subgroup.
• The number of \(k\)-sums modulo \(k\)
• The number of zero sums modulo m in a sequence of length n
• Two addition theorems
• Two conjectures on an addition theorem
• Zero-sum problems -- a survey
• Zero-sum problems in finite Abelian groups: a survey

Cited in

(3)

• Representing sequence subsums as sumsets of near equal sized sets
• Iterated sumsets and Olson's generalization of the Erdős-Ginzburg-Ziv theorem
• Iterated sumsets and subsequence sums

This page was built for publication: Iterated sumsets and setpartitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780438)