On the existence of zero-sum subsequences of distinct lengths
From MaRDI portal
Publication:422051
DOI10.1216/RMJ-2012-42-2-583zbMath1247.11016arXiv0903.3458MaRDI QIDQ422051
Publication date: 16 May 2012
Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.3458
Units and factorization (11R27) Algebraic combinatorics (05E99) Finite abelian groups (20K01) Dedekind, Prüfer, Krull and Mori rings and their generalizations (13F05) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items
Zero-sum subsequences of distinct lengths ⋮ A multiplicative property for zero-sums. I ⋮ A multiplicative property for zero-sums. II ⋮ Representation of zero-sum invariants by sets of zero-sum sequences over a finite abelian group ⋮ On generalized Narkiewicz constants of finite abelian groups ⋮ Zero-sum problems with congruence conditions ⋮ Structure of a sequence with prescribed zero-sum subsequences: rank two \(p\)-groups ⋮ Normal sequences over finite abelian groups ⋮ A unifying look at zero-sum invariants ⋮ Remarks on a generalization of the Davenport constant ⋮ On the lower bounds of Davenport constant ⋮ Long sequences having no two nonempty zero-sum subsequences of distinct lengths
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular subgraphs of almost regular graphs
- Note on a conjecture of Graham
- Zero-sum problems in finite Abelian groups: a survey
- 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
- On zero-sum subsequences of restricted size. II.
- A combinatorial problem on finite abelian groups
- Normal sequences over finite abelian groups
- Long \(n\)-zero-free sequences in finite cyclic groups
- Sequences not containing long zero-sum subsequences
- A combinatorial problem on finite Abelian groups. I
- Inverse zero-sum problems II
- Combinatorial Nullstellensatz
- Inverse zero-sum problems III
- Inverse zero-sum problems