Desarrangements revisited: statistics and pattern avoidance
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909897022504960 |
|---|---|
| author | Bsila, Chadi Cox, Caroline E. Hugo, Anna S. Styron, Lindsey A. Zhuang, Yan |
| author_facet | Bsila, Chadi Cox, Caroline E. Hugo, Anna S. Styron, Lindsey A. Zhuang, Yan |
| contents | A desarrangement is a permutation whose first ascent is even. Desarrangements were introduced in the 1980s by Jacques Désarménien, who proved that they are in bijection with derangements. We revisit the study of desarrangements, focusing on two themes: the refined enumeration of desarrangements with respect to permutation statistics, and pattern avoidance in desarrangements. Our main results include generating function formulas for counting desarrangements by the number of descents, peaks, valleys, double ascents, and double descents, as well as a complete enumeration of desarrangements avoiding a prescribed set of length 3 patterns. We find new interpretations of the Catalan, Fine, Jacobsthal, and Fibonacci numbers in terms of pattern-avoiding desarrangements. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_19547 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Desarrangements revisited: statistics and pattern avoidance Bsila, Chadi Cox, Caroline E. Hugo, Anna S. Styron, Lindsey A. Zhuang, Yan Combinatorics 05A15 (Primary), 05A05, 05A19 (Secondary) A desarrangement is a permutation whose first ascent is even. Desarrangements were introduced in the 1980s by Jacques Désarménien, who proved that they are in bijection with derangements. We revisit the study of desarrangements, focusing on two themes: the refined enumeration of desarrangements with respect to permutation statistics, and pattern avoidance in desarrangements. Our main results include generating function formulas for counting desarrangements by the number of descents, peaks, valleys, double ascents, and double descents, as well as a complete enumeration of desarrangements avoiding a prescribed set of length 3 patterns. We find new interpretations of the Catalan, Fine, Jacobsthal, and Fibonacci numbers in terms of pattern-avoiding desarrangements. |
| title | Desarrangements revisited: statistics and pattern avoidance |
| topic | Combinatorics 05A15 (Primary), 05A05, 05A19 (Secondary) |
| url | https://arxiv.org/abs/2409.19547 |