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...
I tiakina i:
| Kaituhi matua: | |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Discrete Mathematics & Theoretical Computer Science
2019-10-01
|
| Rangatū: | Discrete Mathematics & Theoretical Computer Science |
| Ngā marau: | |
| Urunga tuihono: | https://dmtcs.episciences.org/5438/pdf |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|