Triangular gaps in the most frequent sizes of hA for |A|=4

2025/11/04 by Senger, Steven
Computer Science · Mathematics · #11B75 #Analytic Number Theory Research #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Mathematics #Limits and Structures in Graph Theory

paper · doi:10.48550/arxiv.2511.03008

openalex publication_date 2025/11/04 · openalex created_date 2025/11/07 · openalex updated_date 2026/07/28

Abstract

We explain the triangular gaps observed experimentally in the most popular sizes of the h-fold iterated sumset, hA, when A is a randomly chosen four-element subset of the first q natural numbers, for q much larger than h.

Citations

• On Nathanson's Triangular Number Phenomenon
• Triangular and tetrahedral number differences of sumset sizes in additive number theory

Related

• Additive sumset sizes with tetrahedral differences
• On Nathanson's Triangular Number Phenomenon
• Triangular and tetrahedral number differences of sumset sizes in additive number theory
• A result on the size of iterated sumsets in ℤ^d
• A note on iterated sumsets races