2000 character limit reached
Labeled Fibonacci Trees
Published 17 Jun 2014 in math.NT and math.CO | (1406.4293v3)
Abstract: The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduced by Fibonacci. In these labelings, Fibonacci sequences appear along ascending branches of the tree, and it is shown that the labels at any level are consecutive integers. The set of labeled trees is a commutative group isomorphic to $\mathbb{Z}2$, and is endowed with an order relation. Properties of the Wythoff array are recovered as a special instance, and further properties of the labeled Fibonacci trees are described. These trees can be viewed as generalizations of the Wythoff array.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.