Related papers: A dynamical property unique to the Lucas sequence
We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…
We afford the problem of counting the blocks of a given length made with symbols drawn from an alphabet and relate this number to Fibonacci-like recurrent relations. The recurrence polynomia allows to calculate the limit ratio of two…
It is well-known that entire functions whose spectrum belongs to a fixed bounded set $S$ admit real uniformly discrete uniqueness sets $\Lambda$. We show that the same is true for much wider spaces of continuous functions. In particular,…
For a dynamical map $\Lambda(t,0)$, which sends a state $\rho(0)$ of quantum open system to a state $\rho(t)=\Lambda(t,0)\rho(0)$, the decomposition law $\Lambda(t,0)=\Lambda(t,t_c)\Lambda(t_c,0)$ may break down at a specific time $t_c$. In…
A case study of arithmetic dynamics over the rationals on the Markoff surface is presented, in particular the local-global dynamical property of strong residual periodicity. The dynamical system induced by the composition of any two of the…
We survey and prove properties a family of recurrences bears in relation to integer representations, compositions, the Pascal triangle, sums of digits, Nim games and Beatty sequences.
We derive a collection of identities for bivariate Fibonacci and Lucas polynomials using essentially a matrix approach as well as properties of such polynomials when the variables $x$ and $y$ are replaced by polynomials. A wealth of…
Bugeaud, Mignotte, and Siksek proved that the only perfect powers in Fibonacci sequence are 0, 1, 8, and 144. In this paper, we study the polynomial analogue of the problem. Especially, we give a complete characterization of the Fibonacci…
We describe dynamical properties of a map $\mathfrak{F}$ defined on the space of rational functions. The fixed points of $\mathfrak{F}$ are classified and the long time behavior of a subclass is described in terms of Eulerian polynomials.
We study the uniform ergodicity property for non-invertible topological and measure-preserving dynamical systems. It is shown that for topological dynamical systems uniform ergodicity is equivalent to eventually periodicity and that for…
The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…
Let $f$ be a meromorphic function with bounded set of singular values and for which infinity is a logarithmic singularity. Then we show that $f$ has infinitely many repelling periodic points for any minimal period $n\geq1$, using a much…
By varying a parameter of a one-dimensional piecewise smooth map, stable periodic orbits are observed. In this paper, complete analytic characterization of these stable periodic orbits is obtained. An interesting relationship between the…
The presence of the power-law memory is a significant feature of many natural (biological, physical, etc.) and social systems. Continuous and discrete fractional calculus is the instrument to describe the behavior of systems with the…
In this work, we consider a class of $n$-dimensional, $n\geq2$, piecewise linear discontinuous maps that can exhibit a new type of attractor, called a weird quasiperiodic attractor. While the dynamics associated with these attractors may…
The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. The main result is twofold: (1) we give the explicit expressions of the numbers of distinct squares and cubes in $\mathbb{T}[1,n]$ (the…
Let the circle act symplectically on a compact, connected symplectic manifold $M$. If there are exactly three fixed points, $M$ is equivariantly symplectomorphic to $\mathbb{CP}^2$.
Constant-recursive sequences are those which satisfy a linear recurrence, so that later terms can be obtained as a linear combination of the previous ones. The rank of a constant-recursive sequence is the minimal number of previous terms…
We study periodic, piecewise linear maps on the plane starting with the Mort Brown's map. We show that if the number of pieces is two, there is only a short list of possible periods (this fact can be seen as the crystallographic restriction…
Dynamical Systems theory generally deals with fixed point iterations of continuous functions. Computation by Turing machine although is a fixed point iteration but is not continuous. This specific category of fixed point iterations can only…