The paper introduces the sets R_Z(h,k) and R_{Z^n}(h,k) collecting all possible cardinalities of hA for |A|=k, studies their complexity, and supplies a diameter-compression algorithm that preserves |hA|.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.NT 2years
2025 2verdicts
UNVERDICTED 2representative citing papers
Constructs infinite families of k-element integer sets and computes their h-fold sumset sizes for h,k ≥ 3.
citing papers explorer
-
Compression and complexity for sumset sizes in additive number theory
The paper introduces the sets R_Z(h,k) and R_{Z^n}(h,k) collecting all possible cardinalities of hA for |A|=k, studies their complexity, and supplies a diameter-compression algorithm that preserves |hA|.
-
Explicit sumset sizes in additive number theory
Constructs infinite families of k-element integer sets and computes their h-fold sumset sizes for h,k ≥ 3.