Metraipolis › archive › dc_571ff4dd3e09
Enumerating Pattern-Avoiding Involutions using Combinatorial Exploration — arXiv:2609.04352
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.04352
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T23:20:39.589Z
- SHA-256 of the archived text
a9cd0b52b98867a929b2efbd9337ee24c10f73df8fb361faa4aa1d866ee20808- Stable URL of this page
https://metraipolis.com/documento/dc_571ff4dd3e09
How to cite
Enumerating Pattern-Avoiding Involutions using Combinatorial Exploration — arXiv:2609.04352 — arXiv (en), https://arxiv.org/abs/2609.04352 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_571ff4dd3e09 (Metraipolis archive dc_571ff4dd3e09, sha256 a9cd0b52b98867a929b2efbd9337ee24c10f73df8fb361faa4aa1d866ee20808)
BibTeX
@misc{dc571ff4dd3e09,
title = {Enumerating Pattern-Avoiding Involutions using Combinatorial Exploration — arXiv:2609.04352},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.04352},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_571ff4dd3e09; sha256 a9cd0b52b98867a929b2efbd9337ee24c10f73df8fb361faa4aa1d866ee20808},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04352. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The enumeration of pattern-avoiding permutations has been a popular area of study over the past several decades, but comparatively little attention has been given to the topic of pattern-avoiding involutions. In this paper, we derive the algebraic generating functions of two Wilf-equivalence classes of involutions avoiding a single pattern of length $4$, $\operatorname{Av^I}(2431)$ and $\operatorname{Av^I}(3421)$. We then adapt the Mosaic method, a fast counting algorithm for permutations, to count involutions and apply it to substantially extend the known initial terms of the counting sequences for the remaining two Wilf-equivalence classes avoiding a pattern of length $4$, $\operatorname{Av^I}(1324)$ and $\operatorname{Av^I}(4231)$. Based on these extended sequences, we empirically analyze the asymptotic behavior of the counting sequences of these two classes.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.04352 — 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-16T23:03:13.229Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).