On the minimum size of subset and subsequence sums in integers

DOI10.5802/CRMATH.361OpenAlexW3193688660MaRDI QIDQ2080952

Yanyan Li

Publication date: 12 October 2022

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (2)

Generalized \(H\)-fold sumset and subsequence sum ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Subsequence sums: direct and inverse problems
• A generalization of sumsets of set of integers
• The critical number of finite abelian groups
• On complete subsets of the cyclic group
• A generalization of Kneser's addition theorem
• An addition theorem and maximal zero-sum free sets in \(\mathbb{Z}/p\mathbb{Z}\)
• Inverse problems for certain subsequence sums in integers
• On a partition analog of the Cauchy-Davenport Theorem
• Subset sums in abelian groups
• Asymptotically tight bounds on subset sums
• Adding Distinct Congruence Classes
• On the cardinality of subsequence sums
• On subset sums of zero-sum free sets of abelian groups
• Inverse Theorems for Subset Sums
• A Note on Sumsets and Restricted Sumsets
• A quadratic lower bound for subset sums
• On the addition of residue classes mod p
• An addition theorem modulo p

This page was built for publication: On the minimum size of subset and subsequence sums in integers