Some families of trees arising in permutation analysis

DOI10.37236/6504zbMath1441.05011arXiv1609.09586OpenAlexW3025978529MaRDI QIDQ2185210

Cyril Nicaud, Mathilde Bouvel, Marni Mishna

Publication date: 4 June 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

separable permutationsstrong interval trees

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Asymptotic enumeration (05A16)

Related Items (2)

Random cographs: Brownian graphon limit and asymptotic degree distribution ⋮ Universal limits of substitution-closed permutation classes

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symmetric functions and P-recursiveness
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Simple permutations and pattern restricted permutations
• AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS
• Schröder’s problems and scaling limits of random trees
• Lambda terms of bounded unary height
• Algorithms – ESA 2005
• Algorithms and Computation

This page was built for publication: Some families of trees arising in permutation analysis