Metraipolis › archive › dc_43cdf99bb105
$k$-Pairing: A Generalization of the Partition Pairing Theorems — arXiv:2610.03437
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.03437
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T08:25:22.799Z
- SHA-256 of the archived text
1094054c8ccb9bcdad705869b8d10dd25c57e8a073464e4873407fa1967e66e4- Stable URL of this page
https://metraipolis.com/documento/dc_43cdf99bb105
How to cite
$k$-Pairing: A Generalization of the Partition Pairing Theorems — arXiv:2610.03437 — arXiv (en), https://arxiv.org/abs/2610.03437 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_43cdf99bb105 (Metraipolis archive dc_43cdf99bb105, sha256 1094054c8ccb9bcdad705869b8d10dd25c57e8a073464e4873407fa1967e66e4)
BibTeX
@misc{dc43cdf99bb105,
title = {$k$-Pairing: A Generalization of the Partition Pairing Theorems — arXiv:2610.03437},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.03437},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_43cdf99bb105; sha256 1094054c8ccb9bcdad705869b8d10dd25c57e8a073464e4873407fa1967e66e4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.03437. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We extend the partition pairing theory of Andrews and Dastidar by replacing pairs with groups of $k$ equal parts. Two weight-preserving bijections give combinatorial interpretations of the joint pairing index--width distribution and the negative-rank enumerations. The first combines conjugation with the Stockhofe--Keith correspondence and sends the $k$-pairing index and width to the number of parts and the largest part, respectively. Consequently, their joint distribution is independent of $k$ and is given by a Gaussian polynomial. We also obtain finite refinements that record the residual statistics. The second bijection sends simply $k$-paired partitions of negative $k$-pairing rank to $k$-regular partitions with marked internal gaps. In a fixed nonzero residue class, sign cancellation leaves rectangular partitions, while gap markings correspond to overlining choices with the smallest part not overlined. This gives direct combinatorial explanations of the divisor counts and the factor $1/2$ in the overpartition enumeration, extending the odd-divisor and odd-overpartition results of Andrews and Dastidar. Finally, motivated by the diagonal pairing of Andrews and Dastidar, we extend the construction to ordered tuples of $k$ Young diagrams. Applying the two-wing transfer operation to pairs of component diagrams defines an equivalence relation on these tuples. We show that two tuples are equivalent if and only if they have the same cell-multiplicity function, and that every equivalence class contains a unique representative whose component diagrams are nested. We also determine the cardinalities of the equivalence classes and identify the nested representatives with plane partitions of rectangular shape. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2610.03437 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T08:18:48.312Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).