LIPIcs.AofA.2024.18.pdf
- Filesize: 0.9 MB
- 14 pages
Document
Periodic Behavior of the Minimal Colijn-Plazzotta Rank for Trees with a Fixed Number of Leaves
Authors
Michael R. Doboli 
,
Hsien-Kuei Hwang ,
Noah A. Rosenberg
-
Part of:
Volume:
35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-07-18
File
Document Identifiers
Author Details
Acknowledgements
We are grateful to Michael Fuchs and Daniel Krenn for discussions of this work, and to Stephan Wagner for discussions and for comments on a draft of the manuscript.
Cite As Get BibTex
Michael R. Doboli, Hsien-Kuei Hwang, and Noah A. Rosenberg. Periodic Behavior of the Minimal Colijn-Plazzotta Rank for Trees with a Fixed Number of Leaves. In 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 302, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.AofA.2024.18
Abstract
The Colijn-Plazzotta ranking is a certain bijection between the unlabeled binary rooted trees and the positive integers, such that the integer associated with a tree is determined from the integers associated with the two immediate subtrees of its root. Letting a_n denote the minimal Colijn-Plazzotta rank among all trees with a specified number of leaves n, the sequence {a_n} begins 1, 2, 3, 4, 6, 7, 10, 11, 20, 22, 28, 29, 53, 56, 66, 67 (OEIS A354970). Here we show that a_n ∼ 2 [2^{P(log₂ n)}]ⁿ, where P varies as a periodic function dependent on {log₂ n} and satisfies 1.24602 < 2^{P(log₂ n)} < 1.33429.
Subject Classification
ACM Subject Classification
- Mathematics of computing → Combinatoric problems
Keywords
- Colijn-Plazzotta ranking
- recurrences
- unlabeled trees
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
A. V. Aho and N. J. A. Sloane. Some doubly exponential sequences. Fibonacci Q., 11:429-437, 1973.
-
C. Colijn and G. Plazzotta. A metric on phylogenetic tree shapes. Syst. Biol., 67:113-126, 2018.
-
M. Fischer, L. Herbst, S. Kersting, L. Kühn, and K. Wicke. Tree balance indices: a comprehensive survey. Springer, Berlin, 2023.
-
H.-K. Hwang, S. Janson, and T.-H. Tsai. Exact and asymptotic solutions of a divide-and-conquer recurrence dividing at half: theory and applications. ACM Trans. Alg., 13:47, 2017.
-
H.-K. Hwang, S. Janson, and T.-H. Tsai. Identities and periodic oscillations of divide-and-conquer recurrences splitting at half. Adv. Appl. Math, 155:102653, 2024.
-
H.-K. Hwang and J.-M. Steyaert. On the number of heaps and the cost of heap construction. In B. Chauvin, P. Flajolet, D. Gardy, and A. Mokkadem, editors, Mathematics and Computer Science II. Trends in Mathematics, pages 295-310, Basel, 2002. Birkhäuser.
-
A.R.P Maranca and N.A. Rosenberg. Bijections between the multifurcating unlabeled rooted trees and the positive integers. Adv. Appl. Math., 153:102612, 2024.
-
S.-Y. Oh and J. C. Kieffer. Fractal compression rate curves in lossless compression of balanced trees. In 2010 IEEE International Symposium on Information Theory (ISIT) Proceedings, pages 106-110, 2010.
-
N. A. Rosenberg. On the Colijn-Plazzotta numbering scheme for unlabaled binary rooted trees. Discr. Appl. Math., 291:88-98, 2021.