Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2411.07662 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915490708848640 |
|---|---|
| author | Bouvel, Mathilde Egge, Eric S. Smith, Rebecca N. Striker, Jessica Troyka, Justin M. |
| author_facet | Bouvel, Mathilde Egge, Eric S. Smith, Rebecca N. Striker, Jessica Troyka, Justin M. |
| contents | We completely classify the asymptotic behavior of the number of alternating sign matrices classically avoiding a single permutation pattern, in the sense of [Johansson and Linusson 2007]. In particular, we give a uniform proof of an exponential upper bound for the number of alternating sign matrices classically avoiding one of eleven particular patterns, and a super-exponential lower bound for all other single-pattern avoidance classes. We also show that for any fixed integer $k$, there is an exponential upper bound for the number of alternating sign matrices that classically avoid any single permutation pattern and contain precisely $k$ negative ones. Finally, we prove that there must be at most $3$ negative ones in an alternating sign matrix which classically avoids both $2143$ and $3412$, and we exactly enumerate the number of them with precisely $3$ negative ones. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_07662 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Enumeration of pattern-avoiding alternating sign matrices: An asymptotic dichotomy Bouvel, Mathilde Egge, Eric S. Smith, Rebecca N. Striker, Jessica Troyka, Justin M. Combinatorics We completely classify the asymptotic behavior of the number of alternating sign matrices classically avoiding a single permutation pattern, in the sense of [Johansson and Linusson 2007]. In particular, we give a uniform proof of an exponential upper bound for the number of alternating sign matrices classically avoiding one of eleven particular patterns, and a super-exponential lower bound for all other single-pattern avoidance classes. We also show that for any fixed integer $k$, there is an exponential upper bound for the number of alternating sign matrices that classically avoid any single permutation pattern and contain precisely $k$ negative ones. Finally, we prove that there must be at most $3$ negative ones in an alternating sign matrix which classically avoids both $2143$ and $3412$, and we exactly enumerate the number of them with precisely $3$ negative ones. |
| title | Enumeration of pattern-avoiding alternating sign matrices: An asymptotic dichotomy |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2411.07662 |