Related papers: Fibonacci-like sequences and shift spaces in symbo…
Using results from neurobiology on perceptual decision making and value-based decision making, the problem of decision making between lotteries is reformulated in an abstract space where uncertain prospects are mapped to corresponding…
The gap in statistics between multi-variate and time-series analysis can be bridged by using entropy statistics and recent developments in multi-dimensional scaling. For explaining the evolution of the sciences as non-linear dynamics, the…
The random local mixture of a family of primitive substitution rules with noble mean inflation multiplier is investigated. This extends the random Fibonacci example that was introduced by Godr\`{e}che and Luck in 1989. We discuss the…
The issue of the "eternal return" is examined from the perspective of the topology of spacetime. Constraints on dynamical laws for the periodic evolution of a system or universe are highlighted. Using a Fourier series expansion, an infinite…
In this paper we study topological entropy and recurrence properties of non-autonomous dynamical system generated by a family of continuous self maps on a compact space X. Specially, we introduce the pseudo-entropy and…
A model for quantum tunnelling of a cluster comprising A identical particles, coupled by oscillator-type potential, through short-range repulsive potential barriers is introduced for the first time in the new symmetrized-coordinate…
Assume that a finite set of points is randomly sampled from a subspace of a metric space. Recent advances in computational topology have provided several approaches to recovering the geometric and topological properties of the underlying…
We study the structure of inverse limit space of so-called Fibonacci-like tent maps. The combinatorial constraints implied by the Fibonacci-like assumption allow us to introduce certain chains that enable a more detailed analysis of…
In this work we propose a new type of shift spaces, called blur shift spaces, where one can represent with a single symbol an entire set of infinite symbols. Such shift spaces are constructed from classical shift spaces, by choosing some…
We show that Genocchi and Bernoulli numbers are closely related to Fibonacci polynomials and derive some q-analogues.
An equivalent definition of the Fibonacci numbers is that they are the unique sequence such that every integer can be written uniquely as a sum of non-adjacent terms. We can view this as we have bins of length 1, we can take at most one…
Using known entropic and information inequalities new inequalities for some classical polynomials are obtained. Examples of Jacobi and Legendre polynomials are considered.
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
We continue our study on relationships between Fibonacci (Lucas) numbers and Bernoulli numbers and polynomials. The derivations of our results are based on functional equations for the respective generating functions, which in our case are…
Let $X$ be a compact metric space and let $f:X\rightarrow X$ be a homeomorphism on $X$. We show that if $f$ is both pointwise recurrent and expansive, then the dynamical system $(X, f)$ is topologically conjugate to a subshift of some…
Entropy can signify different things: For instance, heat transfer in thermodynamics or a measure of information in data analysis. Many entropies have been introduced and it can be difficult to ascertain their different importance and…
We study two problems related to flow equivalence of shift spaces. The first problem, the classification of $S$-gap shifts up to flow equivalence, is partially solved with the establishment of a new invariant for the sofic $S$-gap shifts…
A speedup, like a time change in discrete time dynamics, is a way of moving faster through the orbits of a dynamical system. Linearly recurrence is a stronger form of minimality for subshifts, shared by e.g.\ all primitive substitution…