🔢 mathematics

Restricted generalized Schur numbers

This paper establishes an exact quadratic formula for the restricted generalized Schur number $S_2(k;\ell)$ , which represents the smallest integer $n$ guaranteeing a monochromatic solution to $x_1+\cdots+x_k=x_{k+1}$ with exactly $\ell+1$ distinct values under any 2-coloring, for all sufficiently large $k$ .

Original authors: Collier Gaiser

Published 2026-08-11

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Collier Gaiser

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 a world where numbers aren't just tools for counting your allowance or calculating the score of a video game, but characters in a massive, chaotic party. In the branch of mathematics known as arithmetic Ramsey theory, mathematicians play a game of "find the pattern" with these number characters. The basic rule of the party is simple: if you invite enough numbers to the gathering and assign them to different teams (or "colors"), you are guaranteed to find a specific, tiny group of teammates who can form a perfect equation, like $x_1 + x_2 = x_3$ , without ever leaving their team. This is the essence of Schur's Theorem, a famous result that says no matter how you try to scramble the colors, a monochromatic solution is inevitable if the party gets big enough.

But what if we add a twist to the game? What if we don't just want any group of teammates to solve the equation, but we demand that the group has a specific number of unique individuals? For instance, in the equation $x_1 + x_2 + x_3 = x_4$ , we might ask: "Can we force a solution where all four numbers are different?" or "Can we force a solution where only two distinct numbers are used, like $1+1+1=3$ ?" This is the puzzle of "restricted generalized Schur numbers." It's like asking a bouncer at the door of the number party: "How many guests do I need to invite to guarantee that a specific type of clique, with a specific number of unique faces, will form a math equation?" The answer isn't just a fun party trick; it helps mathematicians understand the hidden order that exists within chaos, revealing how rigid the rules of numbers really are.

In this paper, the author, Collier Gaiser, dives deep into this specific party game, focusing on a version where we fix the number of unique integers allowed in the solution. Let's call the total number of variables in our equation $k+1$ (so we have $k$ numbers adding up to a final number). The paper asks: If we require the solution to use exactly $\ell+1$ distinct numbers, how large does our set of numbers need to be to guarantee a solution?

The paper's main finding is a precise formula for the answer when there are only two colors (Red and Blue) and the number of unique integers ( $\ell+1$ ) is fixed. The author proves that for any fixed $\ell \ge 2$ , if the total number of variables $k$ is large enough, the exact number of integers needed is:
$k^2 + \left[ \frac{(\ell+1)(\ell-2)}{2} + 2 \right]k + \ell(\ell-2)$

To make this concrete, the paper highlights a special, easy-to-remember case: when we require exactly 2 distinct numbers in the solution (meaning $\ell=2$ ). In this scenario, the formula simplifies beautifully to $k^2 + 2k$ . The author proves this is the exact answer for all $k \ge 3$ . This means if you have a set of numbers from 1 to $k^2 + 2k$ , and you color them Red or Blue, you are mathematically guaranteed to find a solution to $x_1 + \dots + x_k = x_{k+1}$ using exactly two different numbers.

However, the paper also draws a hard line in the sand. It explicitly rules out the idea that this formula works for the case where $\ell=1$ (which would mean using only 1 distinct number, like $1+1+\dots+1=k$ ). The author shows that for $\ell=1$ , the "number" of integers needed doesn't actually exist in the same way; you can construct a coloring that avoids this specific type of solution forever, no matter how big your set gets. So, the formula is a powerful tool, but it stops working the moment you try to shrink the solution down to a single unique number.

The author is incredibly confident in these results because they are proven, not just guessed or simulated. The paper provides a rigorous mathematical proof for the lower bound (showing that you can't get away with fewer numbers than the formula says) and a separate proof for the upper bound (showing that if you have that many numbers, you can't avoid the solution). For the general case where $\ell \ge 3$ , the author proves the formula works for "all large enough $k$ ," meaning there is a threshold where the pattern becomes absolute, though the exact size of that threshold for every $\ell$ remains a mystery.

The paper also takes a moment to look at what happens if we relax the rules slightly. Instead of demanding exactly $\ell+1$ distinct numbers, what if we just demand at least $\ell+1$ ? The author shows that the same formula applies here too, effectively generalizing the result. Finally, the paper leaves the reader with a few open questions, inviting future mathematicians to figure out the exact "tipping point" $K$ where the formula becomes perfect for larger values of $\ell$ , and to explore what happens when we use three or more colors instead of just two.

Technical Summary: Restricted Generalized Schur Numbers

Problem Statement
This paper investigates a variation of the classical Schur problem within arithmetic Ramsey theory. The standard generalized Schur number, $S_r(k)$ , is defined as the smallest integer $n$ such that every $r$ -coloring of the set $\{1, 2, \dots, n\}$ contains a monochromatic solution to the equation $x_1 + x_2 + \dots + x_k = x_{k+1}$ . In the standard definition, the variables $x_1, \dots, x_k$ are not required to be distinct, which allows for "trivial" solutions (e.g., $x_1 = \dots = x_k = 1$ ).

Conversely, the "distinct" variant, $S^*_r(k)$ , requires all $x_1, \dots, x_k$ to be distinct. This paper introduces an intermediate concept: the restricted generalized Schur number, denoted $S_r(k; \ell)$ . This is defined as the smallest $n$ such that every $r$ -coloring of $\{1, 2, \dots, n\}$ contains a monochromatic solution $S$ to the equation where the number of distinct integers in the solution set $S$ is exactly $\ell + 1$ . Here, $\ell$ represents the number of distinct values among the $k$ variables on the left-hand side. The paper focuses primarily on the case where $r=2$ (2-colorings) and $\ell$ is fixed while $k$ grows.

Methodology
The author employs a combination of combinatorial construction and case-based analysis to establish bounds for $S_2(k; \ell)$ .

Existence Proofs: The paper first establishes the conditions under which $S_r(k; \ell)$ exists. Using Lemma 2.1, the author relates the existence of a solution with $\ell+1$ distinct integers to a system of linear equations with strictly increasing variables. They invoke Hindman and Leader's theorem to prove that $S_r(k; \ell)$ exists if and only if $\ell \ge 2$ or $r=1$ .
Lower Bound Construction: To prove the lower bound, the author constructs a specific 2-coloring of the set $\{1, 2, \dots, T'-1\}$ that avoids monochromatic solutions with exactly $\ell+1$ distinct integers. The set is partitioned into three intervals: a lower interval $A'_R$ , a middle interval $A_B$ , and an upper interval $A''_R$ . By carefully analyzing the sums of elements within and across these intervals, they demonstrate that no valid monochromatic solution exists within the constructed range.
Upper Bound Proofs: The upper bound is proven by contradiction. Assuming a 2-coloring of $\{1, 2, \dots, T'\}$ ${1, 2, \dots, T^{'}}$ exists without a monochromatic solution of the required type, the author uses the Pigeonhole Principle to identify a monochromatic subset of small integers. They then analyze specific structural cases of these integers (e.g., consecutive integers, odd integers, or mixed patterns) to derive contradictions by forcing the existence of a monochromatic solution.
- For $\ell=2$ , a direct case analysis based on the colors of 1, 2, and 3 is used.
- For $\ell \ge 3$ , the proof involves more complex algebraic manipulations and subcases depending on the spacing of the selected monochromatic integers. The author determines a threshold $K$ (dependent on $\ell$ ) such that for all $k \ge K$ , the derived contradictions hold within the range of the set.

Key Contributions and Results
The primary contribution is the determination of the asymptotic behavior of the restricted generalized Schur numbers for 2-colorings.

Main Theorem (Theorem 1.1): For all $k, \ell \in \mathbb{N}$ with $2 \le \ell \le k$ , the paper proves the lower bound $S_2(k; \ell) \ge k^2 + \left[ \frac{(\ell+1)(\ell-2)}{2} + 2 \right]k + \ell(\ell-2)$ . Furthermore, fixing $\ell$ , the paper proves that for all sufficiently large $k$ , the equality holds:
$S_2(k; \ell) = k^2 + \left[ \frac{(\ell+1)(\ell-2)}{2} + 2 \right]k + \ell(\ell-2)$
Specific Case ( $\ell=2$ ): The author provides a complete solution for $\ell=2$ , showing that $S_2(k; 2) = k^2 + 2k$ for all $k \ge 3$ . This result is derived independently of the general $\ell \ge 3$ proof to ensure a tighter threshold for $k$ .
Generalization to "At Least" Constraints: The paper defines a relaxed version $S_r(k; \tilde{\ell})$ where the solution must have at least $\ell+1$ distinct integers. Corollary 6.3 extends the main asymptotic formula to this relaxed definition, showing $S_2(k; \tilde{\ell})$ follows the same quadratic growth for large $k$ .
Extension to 3 Colors: In Section 6, the author provides a lower bound for the 3-color case, $S_3(k; 2) \ge k^3 + 3k^2 + k - 1$ , and poses the question of whether this bound is tight for large $k$ .

Significance and Claims
The paper claims to resolve the asymptotic behavior of restricted generalized Schur numbers, filling a gap between the standard Schur numbers (where variables need not be distinct) and the distinct-variable Schur numbers (where all variables must be distinct).

Unification: The author notes that if one formally sets $\ell=1$ in their derived formula, it yields $k^2 + k - 1$ , which matches the known exact value for the standard generalized Schur number $S_2(k)$ . This suggests a structural continuity between the restricted and standard definitions.
Existence: The paper rigorously proves the existence of these numbers for $\ell \ge 2$ , a property not immediately obvious from existing Ramsey theory results.
Open Questions: The author modestly notes that while the asymptotic formula is established for large $k$ , the exact threshold $K$ (the smallest $k$ for which the formula holds) remains unknown for $\ell \ge 3$ . They also leave open the determination of the exact value for $S_3(k; 2)$ and the exact thresholds for the relaxed definitions.

The work relies entirely on combinatorial number theory and graph-theoretic versions of Ramsey's theorem, without introducing experimental proposals or external applications. The significance lies in refining the understanding of how constraints on variable distinctness affect the growth rates of Ramsey-type numbers.

More like this