On (102,000)-avoiding inversion sequences
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917069697581056 |
|---|---|
| author | Kim, Sangwook Seo, Seunghyun Shin, Heesung |
| author_facet | Kim, Sangwook Seo, Seunghyun Shin, Heesung |
| contents | In this article, we study (102,000)-avoiding inversion sequences with a fixed number of distinct elements. By introducing simple H-paths, we derive the trivariate generating function for these inversion sequences with respect to their length, number of distinct elements, and rank. As consequences, we obtain an explicit formula for the number of (102,000)-avoiding inversion sequences with fixed length and number of distinct elements and we also provide a formula for those with fixed number of distinct elements and rank. In particular, we show that both the number of (102,000)-avoiding inversion sequences with a fixed number of distinct elements whose maximum element occurs exactly once and the number of those whose rank is zero are given by the 3-Fuss-Catalan numbers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_06308 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On (102,000)-avoiding inversion sequences Kim, Sangwook Seo, Seunghyun Shin, Heesung Combinatorics Primary 05A19, Secondary 05A05, 05A15 In this article, we study (102,000)-avoiding inversion sequences with a fixed number of distinct elements. By introducing simple H-paths, we derive the trivariate generating function for these inversion sequences with respect to their length, number of distinct elements, and rank. As consequences, we obtain an explicit formula for the number of (102,000)-avoiding inversion sequences with fixed length and number of distinct elements and we also provide a formula for those with fixed number of distinct elements and rank. In particular, we show that both the number of (102,000)-avoiding inversion sequences with a fixed number of distinct elements whose maximum element occurs exactly once and the number of those whose rank is zero are given by the 3-Fuss-Catalan numbers. |
| title | On (102,000)-avoiding inversion sequences |
| topic | Combinatorics Primary 05A19, Secondary 05A05, 05A15 |
| url | https://arxiv.org/abs/2511.06308 |