Proofs of Conjectures about Pattern-Avoiding Linear Extensions
After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation. Some recent papers consider specific families of posets and ask how many linear extensions give rise to permutations that avoid certain patterns...
Gardado en:
| Autor Principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Discrete Mathematics & Theoretical Computer Science
2019-10-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Assuntos: | |
| Acceso en liña: | https://dmtcs.episciences.org/5438/pdf |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|