Abstract
In this paper, we synthetise the studies of three papers we deposited on arXiv: see [7,8,9]. The paper considers the extension of the representation used in many of the author’s papers about cellular automata in the hyperbolic plane. In those papers, a particular representation of the natural numbers allows us together with the construction of a corresponding tree to define a coordinate system which can be used to navigate in the corresponding tiling of the hyperbolic plane. We extend those considerations to many other kinds of trees for the same purpose and we also extend the technique used for the tilings \(\{5,4\}\) and \(\{7,3\}\) to the tilings \(\{p,4\}\) and \(\{p+2,3\}\) of the same hyperbolic plane.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Iwamoto C, Andou T, Morita K, Imai K (2002) Computational complexity in the hyperbolic plane. Lecture notes in computer science, vol 2420. Proceedings of MFCS’2002, pp 365–374
Margenstern M (2000) New tools for cellular automata of the hyperbolic plane. J Univ Comput Sci 6(12):1226–1252
Margenstern M (2007) Cellular automata in hyperbolic spaces, vol I. In: Adamatzky A (ed) Theory, collection: advances in unconventional computing and cellular automata. Old City Publishing, Philadelphia, 424p
Margenstern M (2008) Cellular automata in hyperbolic spaces, vol II. In: Adamatzky A (ed) Implementation and computations, Collection: advances in unconventional computing and cellular automata. Old City Publishing, Philadelphia, 360p
Automates cellulaires hyperboliques universels (2015) Parties 1 & 2. Techniques et sciences informatiques 34(3):233–310
Margenstern M (2015) About embedded quarters and points at infinity in the hyperbolic plane, 17pp. arXiv:1507.08495 [cs.CG]
Margenstern M (2019) About Fibonacci trees - I -, 17pp. arXiv:1904.12135 [cs.DM]
Margenstern M (2019) About Fibonacci trees - II - : generalized Fibonacci trees, 35pp. arXiv:1907.04677 [cs.DM.]
Margenstern M (2019) About Fibonacci trees III: multiple Fibonacci trees, 35pp. arXiv:1909.01893 [cs.DM.]
Margenstern M, Skordev G (2003) Fibonacci type coding for the regular rectangular tilings of the hyperbolic plane. J Univ Comput Sci 9(5):398–422
Smullyan R (1992) Gödel’s incompleteness theorems. Oxford University Press, Oxford
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Margenstern, M. (2022). Multiple Fibonacci Trees. In: Adamatzky, A. (eds) Automata and Complexity. Emergence, Complexity and Computation, vol 42. Springer, Cham. https://doi.org/10.1007/978-3-030-92551-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-92551-2_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-92550-5
Online ISBN: 978-3-030-92551-2
eBook Packages: EngineeringEngineering (R0)