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...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Discrete Mathematics & Theoretical Computer Science
2024-04-01
|
| coleção: | Discrete Mathematics & Theoretical Computer Science |
| Assuntos: | |
| Acesso em linha: | http://dmtcs.episciences.org/11169/pdf |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|