2000 character limit reached
Length Functions and the Dimension of Points in Self-Similar Fractal Trees (2403.04043v1)
Published 6 Mar 2024 in math.LO, cs.IT, and math.IT
Abstract: In this paper, we study the effective dimension of points in infinite fractal trees generated recursively by a finite tree over some alphabet. Using unequal costs coding, we associate a length function with each such fractal tree and show that the channel capacity of the length function is equal to the similarity dimension of the fractal tree (up to a multiplicative constant determined by the size of the alphabet over which our tree is defined). Using this result, we derive formulas for calculating the effective dimension and strong effective dimension of points in fractal trees, establishing analogues of several results due to Lutz and Mayordomo, who studied the effective dimension of points in self-similar fractals in Euclidean space. Lastly, we explore the connections between the channel capacity of a length function derived from a finite tree and the measure of maximum entropy on a related directed multigraph that encodes the structure of our tree, drawing on work by Abram and Lagarias on path sets, where a path set is a generalization of the notion of a sofic shift.
- Julia Abrahams. Varn codes and generalized Fibonacci trees. In National Conference Publication-Institution Of Engineers Australia NCP, pages 1171–1173, 1994.
- Julia Abrahams. Code and parse trees for lossless source encoding. Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No. 97TB100171), pages 145–171, 1997.
- Effective strong dimension in algorithmic information and computational complexity. In STACS 2004, pages 632–643. Springer, 2004.
- Path sets in one-sided symbolic dynamics. Advances in Applied Mathematics, 56:109–134, 2014.
- Variable-length codes and finite automata. In Selected topics in information and coding theory, pages 505–584. World Scientific, 2010.
- AA Brudno. Entropy and the complexity of the trajectories of a dynamic system. Trudy Moskovskogo Matematicheskogo Obshchestva, 44:124–149, 1982.
- Derek K Chang. On fibonacci k-ary trees. Fibonacci Quarterly, 24(3):258–262, 1986.
- Information theory: coding theorems for discrete memoryless systems. Cambridge University Press, 2011.
- Algorithmic randomness and complexity. Springer, 2010.
- Kenneth Falconer. Fractal geometry: mathematical foundations and applications. John Wiley & Sons, 2004.
- Key developments in algorithmic randomness. In Johanna N.Y. Franklin and Christopher P. Porter, editors, Algorithmic Randomness: Progress and Prospects, volume 50 of Lecture Notes in Logic. Cambridge University Press, 2020.
- F. R. Gantmacher. The theory of matrices. Vols. 1, 2. Translated by K. A. Hirsch. Chelsea Publishing Co., New York, 1959.
- Huffman coding with unequal letter costs. In Proceedings of the thiry-fourth annual ACM symposium on theory of computing, pages 785–791, 2002.
- Dimension spectra of random subfractals of self-similar fractals. Annals of Pure and Applied Logic, 165(11):1707–1726, 2014.
- Roland Heim. On the algorithmic foundation of information theory. IEEE Transactions on Information Theory, 25(5):557–566, 1979.
- Mathieu Hoyrup. The dimension of ergodic random sequences. In STACS’12 (29th Symposium on Theoretical Aspects of Computer Science), volume 14, pages 567–576. LIPIcs, 2012.
- Andrei Nikolaevich Kolmogorov. Three approaches to the definition of the concept “quantity of information”. Problemy peredachi informatsii, 1(1):3–11, 1965.
- Algorithmic information, plane kakeya sets, and conditional dimension. ACM Transactions on Computation Theory (TOCT), 10(2):1–22, 2018.
- Dimensions of points in self-similar fractals. SIAM Journal on Computing, 38(3):1080–1112, 2008.
- An introduction to symbolic dynamics and coding. Cambridge University Press, 2021.
- Dimension spectra of lines. In Unveiling Dynamics and Complexity: 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings, pages 304–314. Springer, 2017.
- Projection theorems using effective dimension. In 43rd International Symposium on Mathematical Foundations of Computer Science, 2018.
- Bounding the dimension of points on a line. Information and Computation, 275:104601, 2020.
- Jack H Lutz. Gales and the constructive dimension of individual sequences. In International Colloquium on Automata, Languages, and Programming, pages 902–913. Springer, 2000.
- Jack H. Lutz. The dimension of individual strings and sequences. Information and Computation, 187(1):49–79, 2003.
- Neil Lutz. Fractal intersections and products via algorithmic dimension. ACM Transactions on Computation Theory (TOCT), 13(3):1–15, 2021.
- Elvira Mayordomo. A Kolmogorov complexity characterization of constructive hausdorff dimension. Information Processing Letters, 84(1):1–3, 2002.
- André Nies. Computability and randomness, volume 51 of Oxford Logic Guides. Oxford University Press, 2009.
- Stephen G Simpson. Symbolic dynamics: entropy= dimension= complexity. Theory of Computing Systems, 56:527–543, 2015.
- Kolmogorov complexity and algorithmic randomness, volume 220. American Mathematical Soc., 2017.
- Ben Varn. Optimal variable length codes (arbitrary symbol cost and equal code word probability). Information and Control, 19(4):289–301, 1971.
- Homer S White. Algorithmic complexity of points in dynamical systems. Ergodic Theory and Dynamical Systems, 13(4):807–830, 1993.
- The complexity of finite objects and the basing of the concepts of information and randomness on the theory of algorithms. Uspehi Mat. Nauk, 25(6(156)):85–127, 1970.