Inverse Problems for Sumset Sizes of Finite Sets of Integers

DOI10.1080/00150517.2025.2480773MaRDI QIDQ7254459zbMATH OpenFDO

Authors Melvyn B. Nathanson

Publication date 28 May 2026

Published in The Fibonacci Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00150517.2025.2480773

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Density, gaps, topology (11B05) Additive bases, including sumsets (11B13) Representation functions (11B34) Other combinatorial number theory (11B75) Linear Diophantine equations (11D04) The Frobenius problem (11D07) Inverse problems of additive number theory, including sumsets (11P70)

Cites work

• A tight structure theorem for sumsets
• scientific article; zbMATH DE number 933467 (Why is no real title available?)
• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• On subinvariants i. e. semi-invariants to binary quantics of an unlimited order.
• Relative sizes of iterated sumsets
• Structure theorem for multiple addition and the Frobenius problem
• Sums of Finite Sets of Integers
• The Frobenius postage stamp problem, and beyond
• The structure of higher sumsets

This page was built for publication: Inverse Problems for Sumset Sizes of Finite Sets of Integers

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