A new preprint on ternary Parikh matrices
My new preprint, Partition stabilization and semigroup gaps for ternary Parikh matrices, is now available.
It studies words with repeated letters, deriving exact counting formulas through connections with integer partitions and numerical semigroups. Building on my 2006 thesis on Parikh matrices and permutation statistics, the paper determines the sizes of specified classes of three-letter words and describes which near-maximal triple counts can occur.
The article page includes the 15-page PDF, LaTeX source and a verification package with computational checks and partial Lean proofs. The paper contains written proofs and three diagrams. It is an author-published preprint.
First published on 19 October 2026 at 23:04:21 CEST (21:04:21 UTC).