Metraipolis › archive › dc_21118d05cb4b
Complexes of pattern-avoiding injective words — arXiv:2610.07303
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.07303
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:53:03.811Z
- SHA-256 of the archived text
50fdc906d0c0c6d4e2e455b0bea1fcb2e47b8cf64d0630c913c36a2045e4cd38- Stable URL of this page
https://metraipolis.com/documento/dc_21118d05cb4b
How to cite
Complexes of pattern-avoiding injective words — arXiv:2610.07303 — arXiv (en), https://arxiv.org/abs/2610.07303 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_21118d05cb4b (Metraipolis archive dc_21118d05cb4b, sha256 50fdc906d0c0c6d4e2e455b0bea1fcb2e47b8cf64d0630c913c36a2045e4cd38)
BibTeX
@misc{dc21118d05cb4b,
title = {Complexes of pattern-avoiding injective words — arXiv:2610.07303},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.07303},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_21118d05cb4b; sha256 50fdc906d0c0c6d4e2e455b0bea1fcb2e47b8cf64d0630c913c36a2045e4cd38},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07303. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The complex of injective words is a cell complex that arises in a number of different areas. It has applications to proving homological stability and to the study of group cohomology, and it is closely related to the random-to-random Markov chain. This complex was first studied by Farmer, who proved it has the homology of a wedge of top-dimensional spheres. Later, Björner and Wachs established its shellability, and Reiner and Webb uncovered its $S_n$-module structure, observing in the process that the rank of its top homology group is the $n$th derangement number. We introduce natural subcomplexes of the complex of injective words by fixing a permutation pattern $\sigma$ and considering only those injective words in the alphabet $\{1,2,\dots,n\} $ that avoid $\sigma$. We prove that such pattern-avoiding complexes are shellable if $\sigma$ begins or ends with its largest or smallest letter, and we construct homology bases for the complexes avoiding such patterns. For patterns of length 3, all of which have this property, we show that the rank of the top homology of the resulting complex is a Riordan number. All but four patterns of length 4 also have this property, and for two of the remaining four patterns, we establish shellability using a different method. We also introduce a technique to use enumerative combinatorics to prove shellability, and we apply it to the complex of separable injective words, thereby deducing shellability in this case. Along the way, we give a combinatorial formula for all of the $h$-numbers in the full complex of injective words as well as for each of the subcomplexes which we prove are shellable. Going in the other direction, we use shellability of complexes of pattern-avoiding injective words to deduce new refined counting formulas for pattern-avoiding permutations.
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/2610.07303 — 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-07T11:22:09.535Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).