An inverse problem about minimal zero-sum sequences over finite cyclic groups
From MaRDI portal
Recommendations
- On the unsplittable minimal zero-sum sequences over finite cyclic groups of prime order.
- A family of unsplittable minimal zero-sum sequences
- Long unsplittable zero-sum sequences over a finite cyclic group
- Minimal zero-sum sequences in finite cyclic groups
- scientific article; zbMATH DE number 1565072
Cites work
- scientific article; zbMATH DE number 1565072 (Why is no real title available?)
- scientific article; zbMATH DE number 5663737 (Why is no real title available?)
- Davenport's constant for groups with large exponent
- Indexes of unsplittable minimal zero-sum sequences of length \(I(C_n)-1\)
- Inverse zero-sum problems. II.
- Inverse zero-sum problems. III.
- Long minimal zero-sum sequences in the group \(\mathrm{C}_{2}\oplus \mathrm{C}_{2k}\)
- Long unsplittable zero-sum sequences over a finite cyclic group
- Long zero-free sequences in finite cyclic groups.
- Non-unique factorizations. Algebraic, combinatorial and analytic theory
- On long minimal zero sequences in finite abelian groups
- On the index of minimal zero-sum sequences over finite cyclic groups
- On the structure of long unsplittable minimal zero-sum sequences
- Subsums of a zero-sum free subset of an abelian group
Cited in
(6)- Minimal zero-sum sequences in finite cyclic groups
- The Frobenius postage stamp problem, and beyond
- Sums of sets of abelian group elements
- [[:Publication:2312892|Minimal zero-sum sequences over \(-m, n\)]]
- A nonlinear bound for the number of subsequence sums
- A family of unsplittable minimal zero-sum sequences
This page was built for publication: An inverse problem about minimal zero-sum sequences over finite cyclic groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q529474)
