Metraipolis › archive › dc_e31ada2fcb62

On Partitions with Constant-Sum Gap Sequences — arXiv:2611.06417

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.06417
License (as archived)
CC0-1.0
Archived
2026-11-05T18:28:31.259Z
SHA-256 of the archived text
853dcfec8814756ec4c3718c2bd9fbeb7ba46033891ac8e921629705172d5d1f
Stable URL of this page
https://metraipolis.com/documento/dc_e31ada2fcb62

How to cite

On Partitions with Constant-Sum Gap Sequences — arXiv:2611.06417 — arXiv (en), https://arxiv.org/abs/2611.06417 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e31ada2fcb62 (Metraipolis archive dc_e31ada2fcb62, sha256 853dcfec8814756ec4c3718c2bd9fbeb7ba46033891ac8e921629705172d5d1f)
BibTeX
@misc{dce31ada2fcb62,
  title = {On Partitions with Constant-Sum Gap Sequences — arXiv:2611.06417},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.06417},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e31ada2fcb62; sha256 853dcfec8814756ec4c3718c2bd9fbeb7ba46033891ac8e921629705172d5d1f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06417. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We introduce and study \emph{constant-sum gap partitions}: for a fixed nonnegative integer $C$, these are partitions $\lambda=(\lambda_1,\ldots,\lambda_k)$ whose successive differences $d_i=\lambda_{i+1}-\lambda_i$ satisfy $d_i+d_{k-i}=C$ for all valid $i$. We derive the generating function for this family, treating partitions of odd and even length separately, and compute it explicitly for $C=0, 1,2,3,4$. We then construct explicit bijections between constant-sum gap partitions with $2m+1$, respectively $2m$, parts and partitions into odd, respectively even, parts in which parts below the largest part have bounded multiplicity, together with an exact weight relation between a partition and its image. Finally, we give a geometric characterization of constant-sum gap partitions in terms of their Ferrers diagrams: removing a prescribed, linearly growing number of cells from each row renders the diagram symmetric about its middle row, for both the odd- and even-length cases.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.06417 — 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-11-05T18:18:33.999Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).