Metraipolis › archive › dc_c56f30bb565e

Trident Tableaux for Tree-Child Networks with One Reticulation Node: A Bijection with Two-Wall Tableaux — arXiv:2609.28892

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.28892
License (as archived)
CC0-1.0
Archived
2026-10-08T06:36:40.877Z
SHA-256 of the archived text
dcedc7b614b4dbc1c6b6269ba892ad5eef5961908c3e9045840f305f73e56b9b
Stable URL of this page
https://metraipolis.com/documento/dc_c56f30bb565e

How to cite

Trident Tableaux for Tree-Child Networks with One Reticulation Node: A Bijection with Two-Wall Tableaux — arXiv:2609.28892 — arXiv (en), https://arxiv.org/abs/2609.28892 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c56f30bb565e (Metraipolis archive dc_c56f30bb565e, sha256 dcedc7b614b4dbc1c6b6269ba892ad5eef5961908c3e9045840f305f73e56b9b)
BibTeX
@misc{dcc56f30bb565e,
  title = {Trident Tableaux for Tree-Child Networks with One Reticulation Node: A Bijection with Two-Wall Tableaux — arXiv:2609.28892},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.28892},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c56f30bb565e; sha256 dcedc7b614b4dbc1c6b6269ba892ad5eef5961908c3e9045840f305f73e56b9b},
  year = {2026}
}

Archived text

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

Motivated by a word encoding of tree-child networks, we introduce trident tableaux, which are Young tableaux with a unique three-cell column satisfying certain conditions on successors. We construct a bijection between trident tableaux with $n+1$ columns and two-wall tableaux with $n$ columns, that is, two-row fillings with two designated columns in which vertical order is not imposed. The bijection matches the three-part decompositions of the two classes and shows that each class has cardinality $n(n+1)C_n/2$, where $C_n$ is the $n$-th Catalan number. In particular, it gives a trident-tableau interpretation of a shifted form of OEIS A002457. As a consequence, we obtain an exact enumeration of tree-child networks with one reticulation node that contain a trident, and show that their proportion among all tree-child networks with one reticulation node tends to $1/8$ as the number of leaves tends to infinity.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.28892 — 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-08T06:02:10.011Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).