Gray–Payne–Watson and Gray–Payne–Swisher–Watson partition conjectures
Let range over partitions into distinct parts, and define its perimeter by . Let be the number of such partitions with and with more odd parts than even parts, and let be the number with and with more even parts than odd parts. The conjecture is that for every integer .
References
Primary source
Additional references
- A perimeter analogue of Franklin's identity and an inequality related to the parity of parts — arXiv — Philip Cuthbertson
Progress summary
Two new unrefereed manuscripts claim to settle both partition conjectures, but their proofs have not been independently verified.
The conjectures concern fixed-perimeter partition statistics: a Franklin-type comparison between two multiplicity classes and an odd-versus-even bias for distinct-part partitions. Gray, Payne, Swisher, and Watson formulated the latter in 2026; the manuscripts claim both conjectures are now proved.
Known results
- Banerjee, Bhattacharjee, Dastidar, and Saikia (2022) proved the earlier fixed-size parity inequality conjectured by Kim, Kim, and Lovejoy.
- Gray, Payne, Swisher, and Watson (2024) established the general fixed-perimeter bias for and a fixed-perimeter Euler-type identity.
September 2026 claimed proofs
On September 10, 2026, Marcus McCrea’s manuscript claimed an asymptotic proof of the Franklin-statistics conjecture for , with recovering a known identity. A separate 2026 manuscript states that the distinct-part bias conjecture for is true and supplies explicit mappings.
Current status (as of September 2026): both conjectures have claimed manuscript proofs, but neither claim has independent verification; absent that, their mathematical status remains unconfirmed.
Solutions 0
No solutions have been posted yet.