Fixed-perimeter tipping-point conjecture for two residue classes
Fixed-perimeter tipping-point conjecture for two residue classes
For positive integers , define as the number of partitions of into parts that are -distinct and at least , and define as the number of partitions of into parts congruent to or modulo . For positive integers and , the fixed-perimeter tipping-point conjecture.
This conjecture proposes a sharp asymptotic tipping point at , motivated by numerical evidence and by known comparisons between fixed-perimeter partition functions. The supplied statement does not assert a result in the boundary case .
Sources & referencesView supporting material
Primary source
Gabriel Gray, Emily Payne, Holly Swisher and Ren Watson, “Fixed perimeter analogues of some partition results”, arXiv:2502.12394 (2025).
Additional references
2 papers in this index state this conjecture (2025). The statement above is taken from the most recent of them; the others are arXiv:2502.11929.
Progress summary
The conjecture remains open: numerical evidence supports the proposed cutoff, but no proof or counterexample has been publicly reported.
The conjecture appears as Conjecture in a preprint dated February 2025, predicting opposite eventual dominance on the two sides of the threshold . The boundary case is explicitly left more complicated and unresolved apart from selected cases.
Known results
- Straub, 2016: established the fixed-perimeter identity relating odd-part and distinct-part partitions to Fibonacci numbers.
- Fu and Tang, 2018: generalized Straub’s identity.
- Chen et al., 2024: refined these results for corresponding -distinct and residue-class counting functions.
- Kang and Kim, 2021: proved the analogous tipping-point theorem for ordinary fixed-size partition functions.
February 2025 status
The authors present the strict-inequality assertions as conjectural and supported by experimentation, not as proved theorems. Proposition settles selected boundary comparisons, while other boundary regimes remain unclear; no later source reports a proof, counterexample, or verification.
Current status (as of August 2026): The conjecture remains open; only selected boundary-case comparisons are proved, and neither strict-inequality assertion has a reported proof or counterexample.
Sources
Solutions 1
Sign in to submit a solution.
Full proof, with exact exponential asymptotics. Let , , and . The source's proved generating functions (equations (4.4) and (5.2)) give
For each real , denote by the unique solution of . The map is strictly increasing: if , then
The unique dominant pole of is . Indeed, every zero of with satisfies
and equality forces . The pole is simple.
Similarly, writing , every zero of with satisfies
Equality in forces . This pole is simple, and its numerator is strictly positive. Partial fractions therefore give
Both leading constants are positive. If , strict monotonicity gives , so . If , then , so the difference is asymptotic to . Since , this proves the conjecture for every permitted .
Additional critical-case information. When , the common denominator factors as
At , the numerator of equals
Whenever ,
so its sign is determined explicitly by ; the choice gives exact equality for every .
Source: Gray, Payne, Swisher, and Watson, Fixed perimeter analogues of some partition results, Discrete Mathematics 349 (2026), 114968, Conjecture 1.5.