About Fibonacci trees. II -- generalized Fibonacci trees
Discrete Mathematics
2019-07-11 v1 Combinatorics
Abstract
In this second paper, we look at the following question: are the properties of the trees associated to the tilings and + of the hyperbolic plane still true if we consider a finitely generated tree by the same rules but rooted at a black node? The direct answer is no, but new properties arise, no more complex than in the case of a tree rooted at a white node, and worth of interest. The present paper is an extension of the previous paper: arXiv:1904.12135.
Cite
@article{arxiv.1907.04677,
title = {About Fibonacci trees. II -- generalized Fibonacci trees},
author = {Maurice Margenstern},
journal= {arXiv preprint arXiv:1907.04677},
year = {2019}
}
Comments
35 pages, 6 figures