论文标题
完整的不掩饰树的相关排列
Associated Permutations of Complete Non-Ambiguous Trees
论文作者
论文摘要
我们探索完整的非歧义树（CNAT）和排列之间的新连接。我们在类似树状的Tableaux和CNAT的特定子集之间进行两次射击。该地图用于建立和解决一个复发关系，以用于固定尺寸的树状tableaux的数量，而没有被占据的角落，证明了Laborde-Zubieta的猜想。我们最终通过在CNAT上建立行/列交换操作，并确定未来研究的新领域。
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.
