About Fibonacci trees III: multiple Fibonacci trees

09/04/2019
by   Maurice Margenstern, et al.
0

In this third paper, we revisit the question to which extent the properties of the trees associated to the tilings {p,4} of the hyperbolic plane are still true if we consider a finitely generated tree by the same rules but rooted at a black node? What happens if, considering the same distinction between black and white nodes but changing the place of the black son in the rules. What happens if we change the representation of the numbers by another set of digits? We tackle all of these questions in the paper. The present paper is an extension of the previous papers arXiv:1904.12135 and arXiv:1907.04677.

READ FULL TEXT

page 33

page 35

page 36

research
07/10/2019

About Fibonacci trees. II – generalized Fibonacci trees

In this second paper, we look at the following question: are the propert...
research
04/27/2019

About Fibonacci trees. I

In this first paper, we look at the following question: are the properti...
research
11/26/2019

A Note on Computational Complexity of Kill-all Go

Kill-all Go is a variant of Go in which Black tries to capture all white...
research
04/07/2020

Zipping Segment Trees

Stabbing queries in sets of intervals are usually answered using segment...
research
12/28/2018

Tight Bounds on the Minimum Size of a Dynamic Monopoly

Assume that you are given a graph G=(V,E) with an initial coloring, wher...
research
04/09/2020

A Pedagogically Sound yet Efficient Deletion algorithm for Red-Black Trees: The Parity-Seeking Delete Algorithm

Red-black (RB) trees are one of the most efficient variants of balanced ...
research
12/25/2021

An Experimental Evaluation and Investigation of Waves of Misery in R-trees

Waves of misery is a phenomenon where spikes of many node splits occur o...

Please sign up or login with your details

Forgot password? Click here to reset