Generalized Pythagorean Partition Regularity

• Generalized Pythagorean partition regularity studies when quadratic equations like ax²+by²=cz² admit monochromatic solutions under any finite coloring of ℕ.
• It differentiates between pair-partition regularity, requiring a specific pair of variables to share a color, and full partition regularity, which demands all three variables be monochromatic.
• Recent results combine analytic parametrizations, density methods, and multiplicative function techniques to establish unconditional and conditional cases based on square conditions.

The generalized Pythagorean partition regularity problem concerns monochromatic solutions to homogeneous quadratic equations of the form

$$a x^2+b y^2=c z^2,\qquad a,b,c\in \mathbb{Z}\setminus\{0\}.$$

In current arXiv literature, the phrase “Generalized Pythagorean Partition Regularity Conjecture” is used in two closely related senses. One is a pair-partition-regularity conjecture: under natural square conditions on the coefficients, every finite coloring of $\mathbb{N}$ should contain a solution in which a prescribed pair of variables, typically $(x,y)$, has the same color (Frantzikinakis et al., 2024). The other is a stronger full partition regularity conjecture: for $a,b,c\in\mathbb{N}$, the equation should admit a monochromatic triple $(x,y,z)$ in every finite coloring of $\mathbb{N}$ if and only if $(a,b,c)$ is a Rado triple, meaning $a=c$, $b=c$, or $a+b=c$ (Frantzikinakis et al., 13 Aug 2025). The contemporary theory establishes broad pair-regular regimes, strong structured full-triple results for pretentious multiplicative colorings and actions, and several obstructions and negative instances, while leaving the unrestricted full-triple problem open.

1. Formulations, terminology, and scope

For the equation

$\mathbb{N}$0

partition regularity with respect to the pair $\mathbb{N}$1 means that for every finite coloring of $\mathbb{N}$2 there exist distinct $\mathbb{N}$3 of the same color and some $\mathbb{N}$4 such that the equation holds. The analogous notions for $\mathbb{N}$5 and $\mathbb{N}$6 are defined by symmetry. Full partition regularity is stronger: it requires $\mathbb{N}$7 all to be monochromatic. Full partition regularity implies pair regularity for all three pairs, but the converse fails; a standard example is $\mathbb{N}$8, which is pair-regular for each pair but not fully partition regular (Frantzikinakis et al., 2024).

For the pair problem, working over $\mathbb{N}$9 or over $(x,y)$0 is equivalent: pair partition regularity over $(x,y)$1 holds if and only if it holds over $(x,y)$2 (Frantzikinakis et al., 2024). This equivalence reflects the multiplicative character of the analytic framework used in recent work.

A second notion central to the subject is density regularity. Given a multiplicative Følner sequence $(x,y)$3, one defines upper multiplicative density by

$(x,y)$4

An equation is density regular with respect to $(x,y)$5 if every subset $(x,y)$6 of positive upper multiplicative density contains distinct $(x,y)$7 and some $(x,y)$8 satisfying the equation. Density regularity implies pair partition regularity because any finite coloring has a color class of positive multiplicative density (Frantzikinakis et al., 2024).

The stronger, full-triple conjecture is formulated in explicitly Rado-theoretic terms. In that formulation, a triple $(x,y)$9 is called a Rado triple if $a,b,c\in\mathbb{N}$0, $a,b,c\in\mathbb{N}$1, or $a,b,c\in\mathbb{N}$2, and the conjecture asserts that $a,b,c\in\mathbb{N}$3 is partition regular exactly in those cases (Frantzikinakis et al., 13 Aug 2025). The necessity is motivated by the linear shadow $a,b,c\in\mathbb{N}$4, since full partition regularity of the quadratic equation would force partition regularity of the associated linear equation.

2. Natural coefficient conditions and conjectural classifications

The pair-regularity conjecture proposed in "Partition regularity of generalized Pythagorean pairs" identifies a natural square-condition trichotomy. It predicts that if at least one of $a,b,c\in\mathbb{N}$5, $a,b,c\in\mathbb{N}$6, or $a,b,c\in\mathbb{N}$7 is a square, then

$a,b,c\in\mathbb{N}$8

is partition regular with respect to $a,b,c\in\mathbb{N}$9 (Frantzikinakis et al., 2024). By symmetry, the analogous condition for other pairs is obtained by renaming variables. Canonical model cases are $(x,y,z)$0 and $(x,y,z)$1.

The same paper also gives necessary conditions. If the equation is pair partition regular with respect to $(x,y,z)$2, then at least one of

$(x,y,z)$3

must be a perfect square (Frantzikinakis et al., 2024). This does not prove the conjectured sufficiency, but it sharply narrows the admissible coefficient regimes.

Congruence obstructions show that the residual regime in which only $(x,y,z)$4 is square is delicate. If $(x,y,z)$5, $(x,y,z)$6 is odd, and $(x,y,z)$7 is a square, then the equation is not pair partition regular with respect to $(x,y,z)$8; the example $(x,y,z)$9 is explicitly negative. If $\mathbb{N}$0 are odd, $\mathbb{N}$1, and $\mathbb{N}$2 is a nonzero square, then pair partition regularity for $\mathbb{N}$3 forces $\mathbb{N}$4; thus $\mathbb{N}$5 fails pair regularity (Frantzikinakis et al., 2024).

The full-triple conjecture uses a different classification principle. In that setting, the proposed criterion is not a square condition on coefficient products, but the Rado condition $\mathbb{N}$6, $\mathbb{N}$7, or $\mathbb{N}$8 (Frantzikinakis et al., 13 Aug 2025). These two conjectural schemes are compatible but logically distinct: the pair problem asks for same-color coincidence in a chosen pair, whereas the full problem asks for a monochromatic solution in all three variables.

Coefficient regime	Conclusion	Status
$\mathbb{N}$9 or $(a,b,c)$0 square	Pair regularity for $(a,b,c)$1	Unconditional
$(a,b,c)$2 square	Pair regularity for $(a,b,c)$3	Conditional on Conjecture 2
$(a,b,c)$4 or $(a,b,c)$5 or $(a,b,c)$6	Full monochromatic triple	Conjectural in general
Only $(a,b,c)$7 square	Mixed: some cases fail	Partly obstructed

3. Established pair-regularity results

The central 2024 advance is the unconditional theorem that if either $(a,b,c)$8 or $(a,b,c)$9 is a square, then

$a=c$0

is partition regular with respect to $a=c$1 (Frantzikinakis et al., 2024). By symmetry, if either $a=c$2 or $a=c$3 is a square, then the equation is partition regular with respect to $a=c$4. The corresponding density statement is also proved: under the same condition, the equation is density regular with respect to $a=c$5.

A second theorem addresses the remaining natural regime. Assuming an Elliott-type conjecture about correlations of aperiodic multiplicative functions along irreducible binary quadratic forms, if $a=c$6 is a square, possibly zero, then the equation is partition regular with respect to $a=c$7 (Frantzikinakis et al., 2024). The same conditional input yields density regularity. Under Rado’s linear condition $a=c$8 or $a=c$9 or $b=c$0, the conditional theory further implies pair partition regularity simultaneously for all three pairs $b=c$1, $b=c$2, and $b=c$3.

These results generalize the earlier squares-only theory. "Partition regularity of Pythagorean pairs" proved pair partition regularity for $b=c$4 when $b=c$5 are all squares, and also showed that partitions generated by the level sets of a completely multiplicative finite-valued function contain full monochromatic Pythagorean triples (Frantzikinakis et al., 2023). The 2024 work extends the range of coefficients from the all-squares setting to the more flexible square-product conditions $b=c$6, $b=c$7, and $b=c$8 (Frantzikinakis et al., 2024).

Several examples illustrate the distinction between unconditional, conditional, and open regimes. The equation $b=c$9 is pair partition regular for $a+b=c$0 because $a+b=c$1 is square. The equation $a+b=c$2 fits the conjectural pattern because $a+b=c$3 is square, and it is proved conditionally, not unconditionally. The scaled Pythagorean equation $a+b=c$4 is pair-regular for every pair but not fully partition regular. Open examples explicitly listed include

$a+b=c$5

(Frantzikinakis et al., 2024).

4. Parametrizations and analytic mechanism

The modern proofs are built around parametrizations of solution families and a reduction from partition regularity to density regularity for pairs of binary quadratic forms. When $a+b=c$6, solutions are parametrized by

$a+b=c$7

and when $a+b=c$8, by

$a+b=c$9

If $\mathbb{N}$00, an alternative parametrization is

$\mathbb{N}$01

(Frantzikinakis et al., 2024).

These parametrizations reduce the problem to showing that certain pairs $\mathbb{N}$02 of binary quadratic forms are good for density regularity. In the unconditional regime, one form is irreducible quadratic and the other is reducible of the shape $\mathbb{N}$03; in the conditional regime, one must handle pairs of distinct irreducible quadratic forms with the same leading $\mathbb{N}$04 coefficient (Frantzikinakis et al., 2024).

The analytic core is a structure/randomness dichotomy for multiplicative functions. Pretentious multiplicative functions are those approximable, in pretentious distance, by $\mathbb{N}$05; non-pretentious ones are aperiodic. For a homogeneous polynomial $\mathbb{N}$06, the theory introduces a $\mathbb{N}$07-weighted pretentious distance

$\mathbb{N}$08

with weights determined by the local root count of $\mathbb{N}$09 modulo $\mathbb{N}$10 (Frantzikinakis et al., 2024). The aperiodic case is handled by vanishing-of-correlation theorems for expressions such as $\mathbb{N}$11, while the pretentious case is controlled by concentration estimates along irreducible quadratic forms.

A key innovation of the 2024 paper is uniform concentration for irreducible binary quadratic forms after freezing congruence classes on highly divisible lattices. This produces approximations of the form

$\mathbb{N}$12

with explicit control in terms of pretentious norms on prime ranges and an $\mathbb{N}$13 error (Frantzikinakis et al., 2024). The independence of the phase from the multiplicative averaging parameter $\mathbb{N}$14 is crucial, because it allows averaging over multiplicative Følner sets to eliminate oscillation.

Weighted positivity then supplies the major-arc contribution. Trapezoidal weights

$\mathbb{N}$15

have positive average when either one form is reducible or the two forms share the same leading coefficient (Frantzikinakis et al., 2024). Combined with minor-arc vanishing, this yields a positivity theorem for weighted correlations on the compact group of completely multiplicative functions, and Theorem 2.4 of the paper converts that analytic positivity into combinatorial density regularity. This framework extends the earlier measure-on-$\mathbb{N}$16 and concentration method developed for classical Pythagorean pairs (Frantzikinakis et al., 2023).

5. Pretentious full-triple recurrence and structured colorings

The strongest current results toward full monochromatic generalized Pythagorean triples occur in the setting of pretentious multiplicative dynamics. "Recurrence for pretentious systems along generalized Pythagorean triples" formulates an ergodic version of the Rado-triple conjecture for multiplicative actions $\mathbb{N}$17 and proves it for pretentious actions, meaning actions whose spectral measures are supported on pretentious completely multiplicative functions (Frantzikinakis et al., 13 Aug 2025).

Its main theorem states that if $\mathbb{N}$18 is a Rado triple, then for every pretentious multiplicative action and every measurable set $\mathbb{N}$19 with $\mathbb{N}$20, and for every $\mathbb{N}$21, there exist distinct $\mathbb{N}$22 such that

$\mathbb{N}$23

and

$\mathbb{N}$24

This gives the ergodic-theoretic form of the conjecture in the “critical” structured case (Frantzikinakis et al., 13 Aug 2025).

A concrete combinatorial corollary concerns colorings generated by finitely many pretentious completely multiplicative functions $\mathbb{N}$25. For every open arc $\mathbb{N}$26 containing $\mathbb{N}$27, there exist distinct $\mathbb{N}$28 such that

$\mathbb{N}$29

Thus any finite coloring coming from level sets of finitely many pretentious multiplicative functions contains a monochromatic generalized Pythagorean triple (Frantzikinakis et al., 13 Aug 2025). This extends the earlier finite-image multiplicative-coloring result for the classical Pythagorean equation (Frantzikinakis et al., 2023).

The proof strategy is again spectral and pretentious. It combines linear and quadratic concentration estimates, highly divisible multiplicative grids, Chinese Remainder Theorem factorizations that isolate prime supports of parametrizing forms, Archimedean control through polynomial visit-time sets, and characteristic-factor reductions culminating in Chu’s inequality. The theorem also delineates the boundary of the method: outside the Rado regime, multiple recurrence can fail, and the full conjecture for general multiplicative actions remains open (Frantzikinakis et al., 13 Aug 2025).

6. Broader context, analogues, and open landscape

The generalized Pythagorean problem sits between several neighboring theories. Over finite fields, a robust monochromatic analogue is known: for every $\mathbb{N}$30 and exponents $\mathbb{N}$31, every sufficiently large prime field $\mathbb{N}$32 admits at least $\mathbb{N}$33 monochromatic solutions to

$\mathbb{N}$34

under any $\mathbb{N}$35-coloring (Lindqvist, 2016). In particular, $\mathbb{N}$36 is quantitatively partition regular in all sufficiently large finite fields. This finite-field result is methodologically different, relying on polynomial regularity, counting, and Ramsey lemmas in a compact Abelian model rather than the multiplicative-pretentious framework used over $\mathbb{N}$37.

In higher numbers of variables, a Rado-type classification is available. For diagonal forms in $\mathbb{N}$38th powers,

$\mathbb{N}$39

partition regularity over $\mathbb{N}$40 is characterized, for sufficiently many variables, by the existence of a nonempty subset of coefficients summing to zero. For squares, the threshold is $\mathbb{N}$41, yielding partition regularity of

$\mathbb{N}$42

in every finite coloring (Chow et al., 2018). This shows that generalized Pythagorean partition regularity is well understood in the many-variable diagonal regime even though the three-variable case remains subtle.

Nonlinear partition regularity beyond linearity has also been explored from an ultrafilter perspective. "Kernel Partition Regularity Beyond Linearity" proves partition regularity for weak nonlinear Rado systems and multiplicatively decorated Rado systems whenever the linear backbone satisfies the column condition, but it does not settle genuine equations of the form $\mathbb{N}$43 or $\mathbb{N}$44 with all variables synchronized in one color (Goswami, 2024). This distinction is important: polynomially augmented linear systems and generalized Pythagorean triples belong to different structural classes.

Historically, the combinatorial geometry of the Pythagorean triple hypergraph was studied through its sum property and the absence of Steiner triple systems. Before later progress on pair regularity and structured monochromaticity, computational work established large finite two-colorings with no monochromatic Pythagorean triple on long initial segments and showed that the hypergraph of Pythagorean triples contains no Steiner triple system (Cooper et al., 2015). Those results did not resolve the infinite problem, but they clarified why straightforward finite-obstruction arguments are difficult.

The main open problems are now sharply formulated. For pair regularity, the remaining barrier is the Elliott-type Conjecture 2 on vanishing correlations of aperiodic multiplicative functions along irreducible binary quadratic forms; its resolution would complete the $\mathbb{N}$45-square case and substantially close the pair conjecture (Frantzikinakis et al., 2024). For full monochromatic triples, no Rado triple is yet known to satisfy unrestricted partition regularity in every finite coloring of $\mathbb{N}$46, and the ergodic and combinatorial conjectures remain open beyond pretentious systems (Frantzikinakis et al., 13 Aug 2025). A plausible implication is that the decisive obstacle lies not in parametrization itself, but in extending minor-arc orthogonality and major-arc phase control from pair configurations to genuinely triple-synchronized quadratic patterns.