Combinatorics of non-ambiguous trees
From MaRDI portal
Abstract: This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by Aval, Boussicault and Nadeau. The enumeration of non-ambiguous trees satisfying some additional constraints allows us to give elegant combinatorial proofs of identities due to Carlitz, and to Ehrenborg and Steingr'imsson. We also provide a hook formula to count the number of non-ambiguous trees with a given underlying tree. Finally, we use non-ambiguous trees to describe a very natural bijection between parallelogram polyominoes and binary trees.
Recommendations
- Combinatorics of non-ambiguous trees
- scientific article; zbMATH DE number 2221988
- scientific article; zbMATH DE number 2232270
- Non-ambiguous trees: new results and generalisation
- Non-ambiguous trees: new results and generalization
- The combinatorics of even trees
- Enumeration of \(k\)-noncrossing trees and forests
- Combinatorics of least-squares trees
- Ordered trees and non-crossing partitions
Cites work
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 872231 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- A Sequence of Integers Related to the Bessel Functions
- Algebraic languages and polyominoes enumeration
- Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
- Enumeration of pairs of permutations and sequences
- Hopf algebra of the planar binary trees
- On some properties of permutation tableaux
- Parallelogram polyominoes and corners
- Permutation tableaux and permutation patterns
- The excedance set of a permutation
- The structure of alternative tableaux
- Tree-like tableaux
- Tree-like tableaux
Cited in
(19)- Combinatorial properties of triplet covers for binary trees
- Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees
- Tiered trees, weights, and \(q\)-Eulerian numbers
- Non-ambiguous trees: new results and generalisation
- Heaps and two exponential structures
- The combinatorics of discrete time-trees: theory and open problems
- The number of directed \(k\)-convex polyominoes
- Bijective enumerations of \(\Gamma\)-free \(0\)-\(1\) matrices
- Non-ambiguous trees: new results and generalization
- Associated permutations of complete non-ambiguous trees
- Club-guessing and non-structure of trees
- Combinatorics of non-ambiguous trees
- Tree-tree matrices and other combinatorial problems from taxonomy
- Properties related to the function of the number of undirected non-isomorphic trees
- The combinatorics of even trees
- scientific article; zbMATH DE number 5119884 (Why is no real title available?)
- On the combinatorics of leftist trees
- Combinatorial properties of poly-Bernoulli relatives
- scientific article; zbMATH DE number 7731162 (Why is no real title available?)
This page was built for publication: Combinatorics of non-ambiguous trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402584)
