Combinatorics of non-ambiguous trees

DOI10.1016/j.aam.2013.11.004zbMath1300.05127arXiv1305.3716OpenAlexW2131412839MaRDI QIDQ402584

Mathilde Bouvel, Adrien Boussicault, Matteo Silimbani, Jean-Christophe Aval

Publication date: 28 August 2014

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.3716

zbMATH Keywords

posetsBessel functionparallelogram polyominoestree-like tableauxpermutations excedances

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Enumeration in graph theory (05C30) Polyominoes (05B50)

Related Items (9)

Bijective enumerations of \(\Gamma\)-free \(0\)-\(1\) matrices ⋮ Unnamed Item ⋮ Tiered trees, weights, and \(q\)-Eulerian numbers ⋮ Non-ambiguous trees: new results and generalisation ⋮ The number of directed \(k\)-convex polyominoes ⋮ Combinatorial properties of poly-Bernoulli relatives ⋮ Heaps and two exponential structures ⋮ Unnamed Item ⋮ Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees

Uses Software

• SageMath
• OEIS
• Sage-Combinat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tree-like tableaux
• The structure of alternative tableaux
• Permutation tableaux and permutation patterns
• Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
• Hopf algebra of the planar binary trees
• Algebraic languages and polyominoes enumeration
• The excedance set of a permutation
• Parallelogram polyominoes and corners
• On some properties of permutation tableaux
• A Sequence of Integers Related to the Bessel Functions
• Enumeration of pairs of permutations and sequences

This page was built for publication: Combinatorics of non-ambiguous trees