Asymptotics of relaxed $k$-ary trees (2404.08415v1)
Abstract: A relaxed $k$-ary tree is an ordered directed acyclic graph with a unique source and sink in which every node has out-degree $k$. These objects arise in the compression of trees in which some repeated subtrees are factored and repeated appearances are replaced by pointers. We prove an asymptotic theta-result for the number of relaxed $k$-ary tree with $n$ nodes for $n \to \infty$. This generalizes the previously proved binary case to arbitrary finite arity, and shows that the seldom observed phenomenon of a stretched exponential term $e{c n{1/3}}$ appears in all these cases. We also derive the recurrences for compacted $k$-ary trees in which all subtrees are unique and minimal deterministic finite automata accepting a finite language over a finite alphabet.
- Young Tableaux with Periodic Walls: Counting with the Density Method. Sém. Lothar. Combin., 85B, Article 85B.47:12 pp., 2021.
- Béla Bollobás. Random graphs, volume 73 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, second edition, 2001. [doi].
- XML compression via directed acyclic graphs. Theory Comput. Syst., 57(4):1322–1371, 2015. [doi].
- Enumerative and Distributional Results for d-combining Tree-Child Networks. arXiv preprint, pages 1–48, 2023.
- Variations on the common subexpression problem. J. Assoc. Comput. Mach., 27(4):758–771, 1980. [doi].
- Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language. In AofA 2020, volume 159 of LIPIcs. Leibniz Int. Proc. Inform., pages 11:1–11:13, 2020. [doi].
- Compacted binary trees admit a stretched exponential. J. Combin. Theory Ser. A, 177:105306, 40, 2021. [doi].
- Analytic variations on the common subexpression problem. In Automata, languages and programming, pages 220–234. Springer, 1990. [doi].
- Asymptotic enumeration of compacted binary trees of bounded right height. J. Combin. Theory Ser. A, 172:105177, 2020. [doi].
- Two-dimensional lattice embeddings of connected graphs of cyclomatic index two. J. Phys. A, 11(4):721–729, 1978.
- Anthony J. Guttmann. Analysis of series expansions for non-algebraic singularities. Journal of Physics A: Mathematical and Theoretical, 48(4):045209, 2015. [doi].
- Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 2000. [doi].
- Valery A. Liskovets. Exact enumeration of acyclic deterministic automata. Discrete Applied Mathematics, 154(3):537–551, 2006. [doi].
- Counting phylogenetic networks. Ann. Comb., 19(1):205–224, 2015. [doi].
- Remco van der Hofstad. Random graphs and complex networks. Vol. 1. Cambridge Series in Statistical and Probabilistic Mathematics, [43]. Cambridge University Press, Cambridge, 2017. [doi].
- Michael Wallner. A bijection of plane increasing trees with relaxed binary trees of right height at most one. Theoretical Computer Science, 755:1–12, 2019. [doi].
- Michael Wallner. Dyck paths and inversion tables. Permutation Patterns 2023, pages 142–144, 2023.