Pattern Avoidance in Task-Precedence Posets
We have extended classical pattern avoidance to a new structure: multiple task-precedence posets whose Hasse diagrams have three levels, which we will call diamonds. The vertices of each diamond are assigned labels which are compatible with the poset. A corresponding permutation is formed by reading...
Tallennettuna:
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Discrete Mathematics & Theoretical Computer Science
2016-06-01
|
| Sarja: | Discrete Mathematics & Theoretical Computer Science |
| Aiheet: | |
| Linkit: | https://dmtcs.episciences.org/1324/pdf |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|