Metraipolis › archive › dc_7df1a3a30f91

Descent Tops and Pinnacles on 2143- and 3421-Avoiding Permutations — arXiv:2610.01077

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.01077
License (as archived)
CC0-1.0
Archived
2026-10-06T17:40:57.168Z
SHA-256 of the archived text
7249a1da543a28dccc7b2cf896add09c567deada2b1b3d5932b7b6a3bfa8a686
Stable URL of this page
https://metraipolis.com/documento/dc_7df1a3a30f91

How to cite

Descent Tops and Pinnacles on 2143- and 3421-Avoiding Permutations — arXiv:2610.01077 — arXiv (en), https://arxiv.org/abs/2610.01077 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7df1a3a30f91 (Metraipolis archive dc_7df1a3a30f91, sha256 7249a1da543a28dccc7b2cf896add09c567deada2b1b3d5932b7b6a3bfa8a686)
BibTeX
@misc{dc7df1a3a30f91,
  title = {Descent Tops and Pinnacles on 2143- and 3421-Avoiding Permutations — arXiv:2610.01077},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.01077},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7df1a3a30f91; sha256 7249a1da543a28dccc7b2cf896add09c567deada2b1b3d5932b7b6a3bfa8a686},
  year = {2026}
}

Archived text

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

We prove the 2143-3421 case of Burstein's conjecture on the distribution of descent-top sets by constructing an explicit bijection between the two avoidance classes. The bijection also preserves the pinnacle set and reverses the left-to-right order of the pinnacle values. We combine an involution on maximum Cartesian trees with exchanges of the final entries of maximal decreasing runs. On an intermediate avoidance class, we prove that the exchange procedures terminate and that the output in each direction is independent of the choices made. This gives an explicit inverse. Restricting the bijection to Dumont permutations of the first kind proves the conjecture of Burstein and Jones that 2143 and 3421 are Wilf-equivalent on this class

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