Primc’s conjecture
In the three-row, level-two formulation of Primc's conjecture, the generating function for coloured partitions satisfying the prescribed local multiplicity conditions equals the generating function for coloured partitions whose parts lie in the prescribed residue classes modulo : . Here and denote, respectively, the two partition classes specified by that formulation of the conjecture.
References
- Automatic partition identities — arXiv — Laurent Bartholdi
Source: arXiv
Progress summary
A 2026 preprint claims a new finite-method proof for one structured case of Primc’s conjecture, while the broader status remains unsettled.
Primc’s conjecture concerns generating-function identities for constrained coloured partitions. Earlier work established the standard four-colour identity, but the newly advertised result concerns a separate three-row, level-two formulation.
Known results
- Dousse and Lovejoy, 2018: proved a non-dilated four-colour Primc identity and recovered the original identity by dilation. [Source: arXiv:1702.07177]
- A later exposition records this as Theorem 1.6 and gives a finite refinement. [Source: arXiv:1811.02251v2]
November 2026 finite-method advance
On November 2, 2026, Laurent Bartholdi’s preprint Automatic partition identities claimed the three-row, level-two case, encoding partition classes by automata and certifying the generating-function identity through finite holonomic systems. The preprint is unrefereed, so this is claimed progress rather than a verified resolution.
Current status (as of November 2026): The classical four-colour identity is reported proved, while Bartholdi’s three-row, level-two advance is an unverified preprint claim and no verified resolution of the broader tracked problem is established.
Solutions 0
No solutions have been posted yet.