Associated Permutations of Complete Non-Ambiguous Trees
We explore new connections between complete non-ambiguous trees (CNATs) and permutations. We give a bijection between tree-like tableaux and a specific subset of CNATs. This map is used to establish and solve a recurrence relation for the number of tree-like tableaux of a fixed size without occupied...
Spremljeno u:
| Glavni autori: | , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Discrete Mathematics & Theoretical Computer Science
2024-04-01
|
| Serija: | Discrete Mathematics & Theoretical Computer Science |
| Teme: | |
| Online pristup: | http://dmtcs.episciences.org/11169/pdf |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|