Related papers: Fibonacci words in hyperbolic Pascal triangles
The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares…
These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…
Algebraic hyperbolicity serves as a bridge between differential geometry and algebraic geometry. Generally, it is difficult to show that a given projective variety is algebraically hyperbolic. However, it was established recently that a…
Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…
We show that superreflexivity can be characterized in terms of bilipschitz embeddability of word hyperbolic groups. We compare characterizations of superreflexivity in terms of diamond graphs and binary trees. We show that there exist…
This is the first in a series of articles devoted to providing a foundation for a theory of flocks of arbitrary cones in PG(3,q). The desire to have such a theory stems from a need to better understand the very significant and applicable…
Hyperbolicity is a graph parameter related to how much a graph resembles a tree with respect to distances. Its computation is challenging as the main approaches consist in scanning all quadruples of the graph or using fast matrix…
We give a generalization of the Pascal triangle called the quasi s-Pascal triangle where the sum of the elements crossing the diagonal rays produce the s-bonacci sequence. For this, consider a lattice path in the plane whose step set is {L…
The Fibonacci cube $\Gamma_n$ is is the graph whose vertices are independent subsets of the path graph of length $n$, where two such vertices are considered adjacent if they differ by the addition or removal of a single element. Klav\v{z}ar…
In this paper we characterize hyperbolic geometry among Hilbert geometry by the property that three medians of any hyperbolic triangle all pass through one point.
The aim of this note is to present a construction of symplectic structures on orientable globally hyperbolic 4-dimensional lorentzian manifolds. Said structures are defined on the manifold itself, not on its cotangent bundle. It also…
For every group $G$, we introduce the set of hyperbolic structures on $G$, denoted $\mathcal{H}(G)$, which consists of equivalence classes of (possibly infinite) generating sets of $G$ such that the corresponding Cayley graph is hyperbolic;…
The $n$-th Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by binary strings with no two consecutive ones. We determine $\pi(\Gamma_n) = 2^n$ for $n \le 6$, so the pebbling number of $\Gamma_n$ equals that of the…
We modify the rules of the classical Tower of Hanoi puzzle in a quite natural way to get the Fibonacci sequence involved in the optimal algorithm of resolution, and show some nice properties of such a variant. In particular, we deduce from…
In this paper, we generalize the well-known hyperbolic numbers to certain numeric structures scaled by the real numbers. Under our scaling of $\mathbb{R}$, the usual hyperbolic numbers are understood to be our 1-scaled hyperbolic numbers.…
Algebraically fibering group is an algebraic generalization of the fibered 3-manifold group in higher dimensions. Let $M(\mathcal{P})$ and $M(\mathcal{E})$ be the cusped and compact hyperbolic real moment-angled manifolds associated to the…
In this work, we introduce a symmetric algorithm obtained by the recurrence relation a_{n}^{k}=a_{n-1}^{k}+a_{n}^{k-1}. We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacci- and Lucas numbers.…
Tilings of the hyperbolic plane are of significant interest among many branches of mathematics, physics and computer science. Yet, their construction remains a non-trivial task. Current approaches primarily use tree-based recursive…
In this paper, we investigate the combinatorial and density properties of infinite words generated by Fibonacci-type morphisms, focusing on their subword structure, palindrome density, and extremal statistical behaviors. Using the morphism…
We explicate a number of notions of algebraic laminations existing in the literature, particularly in the context of an exact sequence $$1\to H\to G \to Q \to 1 $$ of hyperbolic groups. These laminations arise in different contexts:…