Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
We give three applications of a recently-proven "Decomposition Lemma," which allows one to count preimages of certain sets of permutations under West's stack-sorting map $s$. We first enumerate the permutation class $s^{-1}(\text{Av}(231,321))=\text{Av}(2341,3241,45231)$, finding a new example of an...
Сохранить в:
| Главный автор: | |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Discrete Mathematics & Theoretical Computer Science
2021-04-01
|
| Серии: | Discrete Mathematics & Theoretical Computer Science |
| Предметы: | |
| Online-ссылка: | https://dmtcs.episciences.org/6709/pdf |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|