Sums of Finite Sets of Integers

DOI10.2307/2318072MaRDI QIDQ5663945zbMATH OpenOpenAlexFDO

Authors Melvyn B. Nathanson

Publication date 1972

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2318072

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Arithmetic functions; related numbers; inversion formulas (11A25)

Cited in

(23)

• Cofinite subsets of asymptotic bases for the positive integers
• On the cardinality of general h-fold sumsets
• On the structure of the \(h\)-fold sumsets
• Chromatic sumsets
• The Frobenius postage stamp problem, and beyond
• Constructions of generalized MSTD sets in higher dimensions
• Generalized more sums than differences sets
• When sets can and cannot have sum-dominant subsets
• Fringe pairs in generalized MSTD sets
• Some inverse results of sumsets
• A tight structure theorem for sumsets
• Sums of Finite Sets of Integers, II
• Khovanskii's theorem and effective results on sumset structure
• The structure of higher sumsets
• Polynomial growth of sumsets in abelian semigroups
• Sumsets and Veronese varieties
• On the structure of the sumsets
• On the size and structure of \(t\)-representable sumsets
• Relative sizes of iterated sumsets
• A conjecture by Bienvenu and Geroldinger on power monoids
• Inverse Problems for Sumset Sizes of Finite Sets of Integers
• On the automorphisms of the power semigroups of a numerical semigroup
• A generalization of sumsets of set of integers

This page was built for publication: Sums of Finite Sets of Integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5663945)