Compacted binary trees admit a stretched exponential

08/29/2019
by   Andrew Elvey Price, et al.
0

A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that the number of compacted binary trees of size n is asymptotically given by Θ( n! 4^n e^3a_1n^1/3 n^3/4), where a_1≈-2.338 is the largest root of the Airy function. Our method involves a new two parameter recurrence which yields an algorithm of quadratic arithmetic complexity for computing the number of compact trees of a given size. We use empirical methods to estimate the values of all terms defined by the recurrence, then we prove by induction that these estimates are sufficiently accurate for large n to determine the asymptotic form of the number of compacted trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2020

A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals

Binary trees are essential structures in Computer Science. The leaf (lea...
research
07/15/2019

Binary Decision Diagrams: from Tree Compaction to Sampling

Any Boolean function corresponds with a complete full binary decision tr...
research
04/27/2018

Average Case Analysis of Leaf-Centric Binary Tree Sources

We study the average size of the minimal directed acyclic graph (DAG) wi...
research
05/12/2021

Isomorphic unordered labeled trees up to substitution ciphering

Given two messages - as linear sequences of letters, it is immediate to ...
research
03/17/2023

A Comparison of Dijkstra's Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees

This paper describes the shortest path problem in weighted graphs and ex...
research
08/31/2018

How to Fit a Tree in a Box

We study compact straight-line embeddings of trees. We show that perfect...
research
04/22/2019

Clifford algebras, Spin groups and qubit trees

Representations of Spin groups and Clifford algebras derived from struct...

Please sign up or login with your details

Forgot password? Click here to reset