Automatic partition identities
Abstract
We encode certain sets of partitions by regular languages of boundary words, so that their generating functions become rational series in the quantum plane RU=qUR. An equality between two partition counts is certified by writing the difference of their series as (1−U)a+b(1−R), with a,b converging q-adically. We show that a,b may be chosen as solutions of finite holonomic systems of q-difference equations computed from the automata, and describe finite certificates of their convergence, together with bounded searches for such certificates; the searches need not succeed, but a false identity is always detected. As an application, we prove the three-row, level-two case of Primc's conjecture, which equates counts of coloured partitions subject to local multiplicity conditions with counts of coloured partitions whose parts lie in prescribed residue classes modulo eight.
Related
- A Combinatorial Proof of Partition Identities for the Number of Distinct Part Sizes
- Commutator identities, Lie product identities, and Multiplicative Lie algebras
- The three Kanade-Russell identities modulo nine
- New companions to the Andrews–Gordon identities motivated by commutative algebra
- Identities and congruences involving orthogonal polynomials and Apéry-like numbers
BibTeX
@misc{bartholdi2026automatic,
title = {{Automatic partition identities}},
author = {Laurent Bartholdi},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.04020},
eprint = {2611.04020},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.04020},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Automatic partition identities
AU - Laurent Bartholdi
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.04020
UR - https://arxiv.org/abs/2611.04020
AB - We encode certain sets of partitions by regular languages of boundary words, so that their generating functions become rational series in the quantum plane RU=qUR. An equality between two partition counts is certified by writing the difference of their series as (1−U)a+b(1−R), with a,b converging q-adically. We show that a,b may be chosen as solutions of finite holonomic systems of q-difference equations computed from the automata, and describe finite certificates of their convergence, together with bounded searches for such certificates; the searches need not succeed, but a false identity is always detected. As an application, we prove the three-row, level-two case of Primc's conjecture, which equates counts of coloured partitions subject to local multiplicity conditions with counts of coloured partitions whose parts lie in prescribed residue classes modulo eight.
ER -