Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
Defant, Engen, and Miller defined a permutation to be uniquely sorted if it has exactly one preimage under West's stack-sorting map. We enumerate classes of uniquely sorted permutations that avoid a pattern of length three and a pattern of length four by establishing bijections between these classes...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Discrete Mathematics & Theoretical Computer Science
2021-08-01
|
| Colección: | Discrete Mathematics & Theoretical Computer Science |
| Materias: | |
| Acceso en línea: | https://dmtcs.episciences.org/6494/pdf |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|