Asymptotic enumeration of compacted binary trees of bounded right height

DOI10.1016/j.jcta.2019.105177zbMath1433.05154arXiv1703.10031OpenAlexW2997499258WikidataQ126433633 ScholiaQ126433633MaRDI QIDQ2299626

Michael Wallner, Manuel Kauers, Antoine Genitrini, Bernhard Gittenberger

Publication date: 21 February 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

Chebyshev polynomialsenumerationanalytic combinatoricsdirected acyclic graphscompacted treesd-finiteness

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics ⋮ Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study ⋮ A bijection of plane increasing trees with relaxed binary trees of right height at most one ⋮ Compacted binary trees admit a stretched exponential

Uses Software

• DLMF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• XML compression via directed acyclic graphs
• Asymptotic enumeration of extensional acyclic digraphs
• Enumeration of generalized BCI lambda-terms
• Sampling different kinds of acyclic automata using Markov chains
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
• Asymptotic behaviour of the poles of a special generating function for acyclic digraphs
• The asymptotic number of acyclic digraphs. I
• The asymptotic number of acyclic digraphs. II
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• A bijection of plane increasing trees with relaxed binary trees of right height at most one
• On the number of unary-binary tree-like structures with restrictions on the unary height
• Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming
• Counting phylogenetic networks
• Generating connected acyclic digraphs uniformly at random
• Exact enumeration of acyclic deterministic automata
• Random Generation of Directed Acyclic Graphs
• On the shape of a random acyclic digraph
• Variations on the Common Subexpression Problem
• Lambda terms of bounded unary height
• Repeated fringe subtrees in random rooted trees
• The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes

This page was built for publication: Asymptotic enumeration of compacted binary trees of bounded right height