A nonlinear bound for the number of subsequence sums

DOI10.1016/j.ejc.2023.103907arXiv2212.10377OpenAlexW4389321327MaRDI QIDQ6201888

Vsevolod F. Lev

Publication date: 26 March 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Abelian groups (20Kxx) Sequences and sets (11Bxx) Additive number theory; partitions (11Pxx)

Cites Work

• An inverse problem about minimal zero-sum sequences over finite cyclic groups
• Behaving sequences
• Generalized arithmetical progressions and sumsets
• Sums of sets of abelian group elements
• On the index of minimal zero-sum sequences over finite cyclic groups
• Long zero-free sequences in finite cyclic groups.
• A combinatorial problem on finite Abelian groups. II
• A combinatorial problem on finite Abelian groups. I
• Conditions for a Zero Sum Modulo n
• Two combinatorial problems in group theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A nonlinear bound for the number of subsequence sums