Associated Permutations of Complete Non-Ambiguous Trees
Combinatorics
2024-04-04 v6
Abstract
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.
Cite
@article{arxiv.2210.11117,
title = {Associated Permutations of Complete Non-Ambiguous Trees},
author = {Daniel Chen and Sebastian Ohlig},
journal= {arXiv preprint arXiv:2210.11117},
year = {2024}
}