collaborators
Showing math.NTShow all

16 papers · 1 filter

math.NT2026

Sidon sets with -separated sumsets in additive number theory

Melvyn B. Nathanson

The nonempty set of integers is -separated if for all with . The set is a -set if every element of the sumset has a uni…

math.NT2026

A problem on sumset sizes of sets of lattice points

Melvyn B. Nathanson

A central problem in additive number theory is to understand the set of sizes of -fold sums of finite subsets of an additive abelian semigroup. It is proved that the "range of s…

math.NT2026

Problems in additive number theory, VII: The structure of additive -bases for

Melvyn B. Nathanson

In additive number theory, a finite set of integers is an -basis for if every integer in can be represented as the sum of exactly not necessari…

math.NT2026

Diversity, equity, and inclusion for problems in additive number theory

Melvyn B. Nathanson

This is a survey of the diversity of problems in additive number theory. Equity requires the consideration of less currently popular problems, and suggests their inclusion in the a…

math.NT2026

Arithmetical structure of sumset intersections

Diego Marques, Melvyn B. Nathanson

The -fold sumset of a set of integers is the set of all sums of not necessarily distinct elements of . Let be a strictly decreasing sequence of…

math.NT2026

Sumset size races for measurable sets

Melvyn B. Nathanson

Let be a locally compact abelian group with Haar measure . For integers and and for any -tuples $\mathbf{u}_1,\ldots, \mathbf{u}_H \in \mathbf{N}^n…