🔢 mathematics

A positive answer to the Owings's sumsets question

This paper positively resolves Owings's sumsets question by proving that for any 2-coloring of the natural numbers, there exists an infinite subset $B$ such that the sumset $B+B$ is monochromatic, while also presenting weighted generalizations of this result.

Original authors: Wen Huang, Zhengxing Lian, Song Shao, Rongzhong Xiao, Leiye Xu, Shuhao Zhang

Published 2026-07-21

📖 3 min read🧠 Deep dive

CC BY 4.0

Original authors: Wen Huang, Zhengxing Lian, Song Shao, Rongzhong Xiao, Leiye Xu, Shuhao Zhang

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are hosting a massive, never-ending party where every guest is assigned a number starting from 1, 2, 3, and so on, forever. Now, imagine you have a bucket of red paint and a bucket of blue paint. You decide to paint every single guest either red or blue, creating a chaotic, colorful crowd. The question that has puzzled mathematicians for decades is: No matter how messy or random your painting job is, can you always find a secret group of guests who are all the same color, and when you pair them up to "dance" (add their numbers together), the resulting dance partners are also all the same color?

This field of study is called combinatorial number theory, and it's basically the art of finding hidden patterns in huge, messy piles of numbers. Think of it like looking for a specific shape in a cloud of cotton candy. Mathematicians have long known that if you have a big enough group of numbers, you can find patterns where you add different numbers together (like $x + y$ where $x$ and $y$ are different). But a tricky rule in this game is that you usually can't add a number to itself (like $x + x$ ). If you allow a number to dance with itself, the patterns can sometimes disappear, depending on how you colored the crowd. The big mystery, known as the Owings question, was whether this "no self-dancing" rule was the only thing stopping us from finding a perfect, same-colored pair-group in a two-color world.

This paper, written by a team of mathematicians, steps into the ring to answer that mystery. They prove that the answer is a resounding "yes." Even if you try your hardest to paint the numbers red and blue in a way that breaks all the rules, you cannot escape the pattern. The authors show that no matter how you split the natural numbers into two colors, there will always be an infinite group of numbers that are all the same color, and when you add any two of them together (even if they are the same number), the result is also that same color. They didn't just guess; they built a rigorous mathematical proof to show this is impossible to avoid.

However, the story doesn't end with a simple "we solved it." The authors also tested the limits of their discovery. They asked, "What if we try to add three numbers together instead of two?" ( $x + y + z$ ). They constructed a specific, clever example of a red-and-blue painting where you cannot find a group of numbers that works for three-way sums. So, while the two-number version is a guaranteed win, the three-number version is a loss. They also explored "weighted" versions of the problem, where you might add numbers with multipliers (like $2x + 3y$ ). They found that for some of these weighted games, you can still guarantee a pattern, but only if you allow for a tiny shift or adjustment in the numbers. If you try to be too strict or use more than two colors, the pattern breaks again.

In short, the paper confirms that in a two-color world, the universe of numbers is stubbornly organized: you can't scramble the colors enough to hide a perfect, infinite pair-sum group. But if you try to make the game harder by adding a third number to the mix or using more colors, the chaos wins. The authors have drawn a clear line in the sand, proving exactly where the magic of order exists and where it fades into randomness.

Technical Summary of "A Positive Answer to the Owings's Sumsets Question"

Problem Statement
The paper addresses a specific question in combinatorial number theory posed by Owings in 1974 (Problem E2409). The question asks: Given any subset $B$ of the natural numbers $\mathbb{N}$ , does there exist an infinite set $A \subset \mathbb{N}$ such that the sumset $A+A = \{x+y : x,y \in A\}$ is entirely contained in $B$ or entirely contained in its complement $\mathbb{N} \setminus B$ ?

This problem is situated within the context of finite colorings of $\mathbb{N}$ . While Hindman's Theorem (1974) guarantees that for any finite coloring, there exists an infinite sequence whose finite sums (without repetition) are monochromatic, the unrestricted sumset $A+A$ (allowing $x+x$ ) presents a different challenge. Hindman had previously shown that for $r \ge 3$ colors, the answer is negative, and for $r=2$ , he provided positive answers for specific partial cases. The general case for 2-colorings remained open.

Methodology
The authors employ a combination of topological dynamics and ultrafilter theory to resolve the problem.

Topological Dynamical Systems: The proof utilizes the framework of one-sided topological dynamical systems $(X, T)$ , where $X$ is a compact Hausdorff space and $T$ is a continuous map. The authors construct a specific symbolic dynamical system based on the coloring function.
Ultrafilters: The space of ultrafilters $\beta\mathbb{N}_0$ is used to analyze the asymptotic behavior of sequences. The authors utilize the algebraic structure of $\beta\mathbb{N}_0$ (specifically, it being a compact right-topological semigroup) and properties of minimal left ideals and idempotents.
Contradiction Argument: The proof of the main theorem (Theorem 1.1) proceeds by contradiction. The authors assume the existence of a 2-coloring $b$ $b$ where no infinite set $B$ $B$ yields a monochromatic $B+B$ $B + B$ .
- They define an "affine encoding" of the coloring into a compact space $X$ .
- They introduce a continuous involution $J$ (coordinate-wise complementation) and a map $\Delta$ related to the doubling map on indices.
- Using the properties of minimal subsystems and idempotent ultrafilters, they derive a structural property: for any non-principal ultrafilter $p$ , the point $(p+p)c$ (where $c$ is the encoded coloring) must equal $J(Dp)c$, where $D$ is the extension of the doubling map.
- This leads to the construction of a new coloring $h$ with specific properties: $h^{-1}(1)$ is "thick" (contains arbitrarily long intervals), yet no infinite $B$ has a monochromatic $B+B$ under $h$ .
- The thickness of $h^{-1}(1)$ eventually forces the existence of a monochromatic sumset, contradicting the initial hypothesis.

Key Contributions and Results

Theorem 1.1 (Main Result): The paper provides a positive answer to Owings's question. It proves that for any 2-coloring of natural numbers ( $\mathbb{N} = C_1 \sqcup C_2$ ), there exists an index $i \in \{1, 2\}$ and an infinite set $B \subset \mathbb{N}$ such that $B+B \subset C_i$ .
Weighted Forms (Theorems 1.6 and 1.7): The authors investigate weighted sumsets of the form $\{mx + \ell y\}$ ${m x + ℓ y}$ .
- Theorem 1.6: For $m \neq \ell$ , there exists an infinite $B$ and a shift $t \in \{0, m+\ell\}$ such that the set $\{(m+\ell)x : x \in B\} \cup \{mx + \ell y + t : x, y \in B, x < y\}$ is monochromatic.
- Theorem 1.7: For $m > 1$ , there exists an infinite $B$ such that $\{2mx : x \in B\} \cup \{m(x+y) : x, y \in B, x < y\}$ is monochromatic.
Limitations and Counterexamples: The paper clarifies the boundaries of these results:
- 3-Colorings: Proposition 5.1 demonstrates that the result fails for 3-colorings; a counterexample is constructed where no infinite $B$ yields a monochromatic weighted sumset with shifts.
- Question 1.9 (Full Weighted Symmetry): The paper answers Question 1.9 negatively. Proposition 5.2 shows that for $m \neq \ell$ , there exists a 2-coloring where the set $\{mx + \ell y + t_1 : x < y\} \cup \{mx + \ell y + t_2 : x > y\}$ is never monochromatic for any infinite $B$ and shifts $t_1, t_2$ .
- 3-Fold Sums: Section 5.3 constructs a 2-coloring where the 3-fold form of Owings's question fails (i.e., no infinite $B$ exists such that $B+B+B$ is monochromatic).

Significance
The paper resolves a long-standing open problem in combinatorial number theory by confirming that the unrestricted sumset $A+A$ behaves well under 2-colorings, unlike the case for 3 or more colors. The authors note that this result is distinct from Hindman's Theorem regarding repetitions, as it specifically addresses the case where elements can be added to themselves.

Furthermore, the work connects combinatorial number theory with topological dynamics and ultrafilter theory, providing a robust framework for analyzing sumset structures. The paper also delineates the precise limits of these structures, showing that while the 2-fold case holds, generalizations to 3-fold sums or symmetric weighted sums with arbitrary shifts do not hold in the 2-coloring setting. The results contribute to the broader understanding of "large" subsets in natural numbers and their structural properties under finite partitions.

More like this