Related papers: On the Fibonacci sequence and the Linear Time Inva…
We investigate the question, "how does time flow?" and show that time may change by inversions as well. We discuss its implications to a simple class of linear systems. Instead of introducing any unphysical behaviour, inversions can lead to…
Fermi's Golden Rule (FGR) is one of the most impactful formulas in quantum mechanics, providing a link between easy-to-measure observables - such as transition rates - and fundamental microscopic properties - such as density of states or…
Particle-gamma coincidences from the 46Ti(p,p' gamma)46Ti inelastic scattering reaction with 15-MeV protons are utilized to obtain gamma-ray spectra as a function of excitation energy. The rich data set allows analyzing the coincidence data…
The famous series of Fibonacci numbers is defined by a recursive equation saying that each number is the sum of its two predecessors, with the initial condition that the first two numbers are equal to unity. Here, we show that the numbers…
Fractals and quasiperiodic structures share self-similarity as a structural property. Motivated by the link between Fibonacci fractals and quasicrystals which are scaled by the golden mean ratio $\frac{1+\sqrt{5}}{2}$, we introduce and…
Selfsimilar space-time fractal fluctuations are generic to dynamical systems in nature such as atmospheric flows, heartbeat patterns, population dynamics, etc. The physics of the long-range correlations intrinsic to fractal fluctuations is…
This paper introduces the concept of the Fibonacci Word Index $\operatorname{FWI}$, a novel topological index derived from the Albertson index, applied to trees constructed from Fibonacci words. Building upon the classical Fibonacci…
Fermi's golden rule defines the transition rate between weakly coupled states and can thus be used to describe a multitude of molecular processes including electron-transfer reactions and light-matter interaction. However, it can only be…
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…
We write out relations between the base of natural logarithms ($e$), the ratio of the circumference of a circle to its diameter ($\pi$), the golden ratios ($\Phi_p$) of the additive $p$-sequences, and the ratio of the diagonal of a square…
Two very fast and simple O(lg n) algorithms for individual Fibonacci numbers are given and compared to competing algorithms. A simple O(lg n) recursion is derived that can also be applied to Lucas. A formula is given to estimate the largest…
Through well-motivated models in particle physics, we demonstrate the power of a general class of selection rules arising from non-invertible fusion algebras that are only exact at low orders in perturbation theory. Surprisingly, these…
A new class of finitely differentiable scale free solutions to the simplest class of ordinary differential equations is presented. Consequently, the real number set gets replaced by an extended physical set, each element of which is endowed…
Simple methods permit to generalize the concepts of iteration and of recursive processes. We shall see briefly on several examples what these methods generate. In additive sequences, we shall encounter not only the golden or the silver…
This paper shows that the concept of complex frequency, originally introduced to characterize the dynamics of signals with complex values, constitutes a generalization of eigenvalues when applied to the states of linear time-invariant (LTI)…
The following article summarizes research where theorems and their respective demonstrations are postulated based on quadratic equations with special properties given by the Pythagorean triplets and the Fibonacci sequence given the second…
Diffusion is modeled on the recently proposed Hanoi networks by studying the mean- square displacement of random walks with time, <r^2>~t^{2/d_w}. It is found that diffusion - the quintessential mode of transport throughout Nature -…
The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…
The list of properties of Fibonacci numbers F(n) (with multifaceted relevance in physics) is complemented by an empirical observation that in combination with the "next" family of the "delayed Fibonacci" numbers G(n) called, 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…