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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2024-04-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/11169/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 corners, proving a conjecture by Laborde-Zubieta. We end by establishing a row/column swapping operation on CNATs and identify new areas for future research. |
|---|---|
| ISSN: | 1365-8050 |