English
Related papers

Related papers: About Fibonacci trees III: multiple Fibonacci tree…

200 papers

In this second paper, we look at the following question: are the properties of the trees associated to the tilings $\{p,4\}$ and $\{p$+$2,3\}$ of the hyperbolic plane still true if we consider a finitely generated tree by the same rules but…

Discrete Mathematics · Computer Science 2019-07-11 Maurice Margenstern

In this first paper, we look at the following question: are the properties of the Fibonacci tree 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…

Formal Languages and Automata Theory · Computer Science 2019-04-30 Maurice Margenstern

This article considers some affine algebraic varieties attached to finite trees and closely related to cluster algebras. Their definition involves a canonical coloring of vertices of trees into three colors. These varieties are proved to be…

Quantum Algebra · Mathematics 2014-03-04 Frédéric Chapoton

In the hyperbolic plane there are infinite regular lattices. From a fix vertex of a lattice tree graphs can be constructed recursively to the next layers with edges of the lattice. In this article we examine the properties of the growing of…

Combinatorics · Mathematics 2015-10-29 László Németh

We show that the class of finite rooted binary plane trees is a Ramsey class (with respect to topological embeddings that map leaves to leaves). That is, for all such trees P,H and every natural number k there exists a tree T such that for…

Combinatorics · Mathematics 2010-05-26 Manuel Bodirsky , Diana Piguet

We consider the enumeration of plane trees (rooted ordered trees) whose vertices are colored according to a specific coloring rule that prescribes which possible pairs of colors can occur as the colors of a parent vertex and its child. This…

Combinatorics · Mathematics 2026-02-19 Stoyan Dimitrov , Nathan Fox , Kimberly Hadaway , Ashley Tharp , Stephan Wagner

Parabolic (resp. hyperbolic) self-embeddings of trees are those which do not fix a non-empty finite subtree and preserve precisely one (resp. two) end(s). We prove that a locally finite tree having a parabolic self-embedding is mutually…

Combinatorics · Mathematics 2023-01-04 Davoud Abdi

We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $\mathbb{F}_2^+$-action may (or not)…

Dynamical Systems · Mathematics 2022-01-07 A. Baraviera , R. Leplaideur

In the last 30 years, the mathematical theory of aperiodic order has developed enormously. Many new tilings and properties have been discovered, few of which are covered or anticipated by the early papers and books. Here, we start from the…

Metric Geometry · Mathematics 2025-01-29 Michael Baake , Franz Gähler , Jan Mazáč

In this paper we elaborate on the structure of the semigroup tree and the regularities on the number of descendants of each node observed earlier. These regularites admit two different types of behavior and in this work we investigate which…

Combinatorics · Mathematics 2008-10-10 Maria Bras-Amoros , Stanislav Bulygin

In this paper, we remind previous results about the tilings $\{p,q\}$ of the hyperbolic plane. We introduce two new ways to split the hyperbolic plane in order to algorithmically construct the tilings $\{p,q\}$ when $q$ is odd.

Computational Geometry · Computer Science 2009-12-19 Margenstern Maurice

In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…

Combinatorics · Mathematics 2011-09-14 Philipp Fahr , Claus Michael Ringel

We give a complete criterion for when two hyperbolic automorphisms of a tree generate a free, discrete subgroup. The decision depends only on three geometric invariants: the translation lengths of the generators and the length of overlap of…

Group Theory · Mathematics 2025-12-02 Yukun Du , Sa'ar Hersonsky

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…

Logic · Mathematics 2025-11-07 Jason Block , Russell Miller

It is shown that the unique representation of positive integers in terms of tribonacci numbers and the unique representation in terms of iterated A, B and C sequences defined from the tribonacci word are equivalent. Two auxiliary…

Number Theory · Mathematics 2020-09-25 Wolfdieter Lang

We consider the structure of a variation of the Fibonacci sequence which is determined by a Bernoulli process. The associated structure of all Bernoulli variations of the Fibonacci sequence can be represented by a directed binary tree,…

History and Overview · Mathematics 2007-12-04 Brian A. Benson

In 1998, B\"{o}cker and Dress gave a 1-to-1 correspondence between symbolically dated rooted trees and symbolic ultrametrics. We consider the corresponding problem for unrooted trees. More precisely, given a tree $T$ with leaf set $X$ and a…

Combinatorics · Mathematics 2018-01-19 Stefan Grünewald , Yangjing Long , Yaokun Wu

Every volume-preserving centre-bunched fibred partially hyperbolic system with 2-dimensional centre either (1) has two distinct centre Lyapunov exponents, or (2) exhibits an invariant continuous line field (or pair of line fields) tangent…

Dynamical Systems · Mathematics 2022-07-28 Sankhadip Chakraborty , Marcelo Viana

We use a combinatorial approximation of the hyperbolic plane to investigate properties of hyperbolic geometry such as exponential growth of perimeter and area of disks, and the linear isoperimetric inequality. This calculations give a…

Geometric Topology · Mathematics 2024-04-09 MurphyKate Montee

We consider questions related to the existence of spanning trees in graphs with the property that after the removal of any path in the tree the graph remains connected. We show that, for planar graphs, the existence of trees with this…

Combinatorics · Mathematics 2019-04-29 Cristina G. Fernandes , César Hernández-Vélez , Orlando Lee , José C. de Pina
‹ Prev 1 2 3 10 Next ›