An inverse problem about minimal zero-sum sequences over finite cyclic groups

DOI10.1016/j.jnt.2017.01.001zbMath1427.11103OpenAlexW2593990458MaRDI QIDQ529474

Svetoslav Savchev, Fang Chen

Publication date: 18 May 2017

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2017.01.001

zbMATH Keywords

inverse zero-sum problemsminimal zero-sum sequenceunsplittable sequence

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Inverse problems of additive number theory, including sumsets (11P70)

Related Items (5)

A nonlinear bound for the number of subsequence sums ⋮ The Frobenius postage stamp problem, and beyond ⋮ Sums of sets of abelian group elements ⋮ Unnamed Item ⋮ Minimal zero-sum sequences over \(-m, n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Indexes of unsplittable minimal zero-sum sequences of length \(I(C_n)-1\)
• Subsums of a zero-sum free subset of an abelian group
• On the index of minimal zero-sum sequences over finite cyclic groups
• Long zero-free sequences in finite cyclic groups.
• Long unsplittable zero-sum sequences over a finite cyclic group
• On the structure of long unsplittable minimal zero-sum sequences
• Davenport’s constant for groups with large exponent
• Inverse zero-sum problems II
• Inverse zero-sum problems III
• On long minimal zero sequences in finite abelian groups

This page was built for publication: An inverse problem about minimal zero-sum sequences over finite cyclic groups