相关论文: Critical Slow Growth in Averaged Meta-Fibonacci Re…

I propose and investigate the use of continuous functional equations for the study of meta-Fibonacci integer sequences. This exploratory study includes three sequences with quite different behavior: Conway's famous sequence $A(n)=…

We study the rate of growth of ratios of intervals delimited by the post-critical orbit of a map in the quasi-quadratic family $x\mapsto -|x|^\alpha +a.$ The critical order $\alpha$ is an arbitrary real number $\alpha>1.$ The range of the…

We consider skew-product maps over circle rotations $x\mapsto x+\alpha$ (mod 1) with factors that take values in SL(2,R). This includes maps of almost Mathieu type. In numerical experiments, with $\alpha$ the inverse golden mean, Fibonacci…

We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…

We study the concatenated Fibonacci constant $\mathcal{F} := 0.F_{1}F_{2}F_{3}\cdots = 0.11235813\cdots$, obtained by concatenating the Fibonacci numbers in the fractional part, and ask whether it is normal. We show that several classical…

We consider random Fibonacci sequences given by $x_{n+1}=\pm \beta x_{n}+x_{n-1}$. Viswanath (\cite{viswanath}), following Furstenberg (\cite{furst}) showed that when $\beta = 1$, $\lim_{n\to \infty}|x_{n}|^{1/n}=1.13...$, but his proof…

We consider skew-product maps over circle rotations $x\mapsto x+\alpha$ (mod 1) with factors that take values in SL(2,R) In numerical experiments with $\alpha$ the inverse golden mean, Fibonacci iterates of almost Mathieu maps with rotation…

We study the generalized random Fibonacci sequences defined by their first nonnegative terms and for $n\ge 1$, $F_{n+2} = \lambda F_{n+1} \pm F_{n}$ (linear case) and $\widetilde F_{n+2} = |\lambda \widetilde F_{n+1} \pm \widetilde F_{n}|$…

We study the limiting behavior of multiple ergodic averages involving sequences of integers that satisfy some regularity conditions and have polynomial growth. We show that for "typical" choices of Hardy field functions $a(t)$ with…

We study how weak disorder affects the growth of the Fibonacci series. We introduce a family of stochastic sequences that grow by the normal Fibonacci recursion with probability 1-epsilon, but follow a different recursion rule with a small…

We use finite-size scaling to investigate the critical behavior of the quasiespecies model of molecular evolution in the single-sharp-peak replication landscape. This model exhibits a sharp threshold phenomenon at Q=Q_c=1/a, where Q is the…

A number of observations are made on Hofstadter's integer sequence defined by Q(n)= Q(n-Q(n-1))+Q(n-Q(n-2)), for n > 2, and Q(1)=Q(2)=1. On short scales the sequence looks chaotic. It turns out, however, that the Q(n) can be grouped into a…

We study recurrence in the real quadratic family and give a sufficient condition on the recurrence rate $(\delta_n)$ of the critical orbit such that, for almost every nonregular parameter $a$, the set of $n$ such that $\vert F^n(0;a) \vert…

A random Fibonacci sequence is defined by the relation g_n = | g_{n-1} +/- g_{n-2} |, where the +/- sign is chosen by tossing a balanced coin for each n. We generalize these sequences to the case when the coin is unbalanced (denoting by p…

The theory of growth kinetics developed previously is extended to the asymmetric case of off-critical quenches for systems with a conserved scalar order parameter. In this instance the new parameter $M$, the average global value of the…

Given a matrix order $n$, a restart parameter $m$ ($m < n$), a decreasing positive sequence $f(0) > f(1) > ... > f(q) \geq 0$, where $q < n/m$, it is shown that there exits an $n$-by-$n$ matrix $A$ and a vector $r_0$ with $\|r_0\|=f(0)$…

We prove global $W^{1,q}(\Omega,\mathbb{R}^m)$-regularity for minimisers of convex functionals of the form $\mathscr{F}(u)=\int_\Omega F(x,Du)\mathrm{d} x$. $W^{1,q}(\Omega,\mathbb{R}^m)$ regularity is also proven for minimisers of the…

The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent…

We use the replica method of statistical mechanics to examine a typical performance of correctly reconstructing $N$-dimensional sparse vector $bx=(x_i)$ from its linear transformation $by=bF bx$ of $P$ dimensions on the basis of…

We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer…