Related papers: Fibonacci-like sequences and shift spaces in symbo…
Given two infinite sequences with known binomial transforms, we compute the binomial transform of the product sequence. Various identities are obtained and numerous examples are given involving sequences of special numbers: Harmonic…
Fibonacci cubes are induced subgraphs of hypercube graphs obtained by restricting the vertex set to those binary strings which do not contain consecutive 1s. This class of graphs has been studied extensively and generalized in many…
The determination of block-entropies is a well established method for the investigation of discrete data, also called symbols (7). There is a large variety of such symbolic sequences, ranging from texts written in natural languages,…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
We continue our study on relationships between Bernoulli polynomials and balancing (Lucas-balancing) polynomials. From these polynomial relations, we deduce new combinatorial identities with Fibonacci (Lucas) and Bernoulli numbers.…
We compute the entanglement entropy in a 2+1 dimensional topological order in the presence of gapped boundaries. Specifically, we consider entanglement cuts that cut through the boundaries. We argue that based on general considerations of…
The focus of this note is to formulate the algorithms and give the examples used by Fibonacci in Liber Abaci to expand any fraction into a sum of unit fractions. The description in Liber Abaci is all verbal and the examples are numbers…
We combine the two classical topological concepts, time-preserving topological factors and synchronizing time-changes of a continuous flow, and explore some of their thermodynamic consequences. Particular focus is put on equilibrium states…
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
We formulate general rules for a coarse-graining of the dynamics, which we term `symbolic dynamics', of feedback networks with monotone interactions, such as most biological modules. Networks which are more complex than simple cyclic…
A symbolic language allowing to solve statistical problems for the systems with nonabelian braid-like topology in 2+1 dimensions is developed. The approach is based on the similarity between growing braid and "heap of colored pieces". As an…
We offer several new summation identities involving harmonic numbers, odd harmonic numbers, and Fibonacci numbers. Our results are derived using three different approaches: partial summation, polynomial identities and binomial…
Topological entropy is a measure of complex dynamics. In this regard, multimodal maps play an important role when it comes to study low-dimensional chaotic dynamics or explain some features of higher dimensional complex dynamics with…
We define the notion of circular words, then consider on such words a constraint derived from the Fibonacci condition. We give several results on the structure of these circular words, then mention possible applications to various…
We consider various properties and manifestations of some sign-alternating univariate polynomials borne of right-triangular integer arrays related to certain generalizations of the Fibonacci sequence. Using a theory of the root geometry of…
We introduce a series of discrete mappings, which is considered to be an extension of the Hietarinta-Viallet mapping with one parameter. We obtain the algebraic entropy for this mapping by obtaining the recurrence relation for the degrees…
In this paper, we consider two questions about topological entropy of dynamical systems. We propose to resolve these questions by the same approach of using \'etale analogs of topological and algebraic dynamical systems. The first question…
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.…
This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…
The non-emptiness, called the Domino Problem, and the characterization of the possible entropies of $\mathbb{Z}^2$-subshifts of finite type are standard problems of symbolic dynamics. In this article we study these questions with horizontal…