Metraipolis › archive › dc_480bf27d86eb

Bijections between pattern-avoiding derangements and desarrangements — arXiv:2608.11085

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11085
License (as archived)
CC0-1.0
Archived
2026-10-19T06:27:30.446Z
SHA-256 of the archived text
4f657f5a5f849ce3d3e55fa8397c88433c30001f378d03f1e0eb0baab7388932
Stable URL of this page
https://metraipolis.com/documento/dc_480bf27d86eb

How to cite

Bijections between pattern-avoiding derangements and desarrangements — arXiv:2608.11085 — arXiv (en), https://arxiv.org/abs/2608.11085 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_480bf27d86eb (Metraipolis archive dc_480bf27d86eb, sha256 4f657f5a5f849ce3d3e55fa8397c88433c30001f378d03f1e0eb0baab7388932)
BibTeX
@misc{dc480bf27d86eb,
  title = {Bijections between pattern-avoiding derangements and desarrangements — arXiv:2608.11085},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11085},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_480bf27d86eb; sha256 4f657f5a5f849ce3d3e55fa8397c88433c30001f378d03f1e0eb0baab7388932},
  year = {2026}
}

Archived text

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

Derangements are permutations without fixed points, and are in bijection with desarrangements: permutations whose first non-descent is even, or equivalently, permutations without ``pixed points''. Bsila, Cox, Hugo, Styron, and Zhuang recently proved a theorem characterizing all $\Pi\subseteq\mathfrak{S}_{3}$, such that $1\leq\left|\Pi\right|\leq3$, for which the number of derangements avoiding all patterns in $\Pi$ is equal to the number of desarrangements avoiding all patterns in $\Pi$. They left finding a bijective proof of this theorem as an open problem, and posed a related conjecture concerning the distributions of fixed points and pixed points over pattern avoidance classes. In this paper, we give bijective proofs of this theorem and conjecture.

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