Related papers: Growth rate for the expected value of a generalize…

Economic growth is measured as the rate of relative change in gross domestic product (GDP) per capita. Yet, when incomes follow random multiplicative growth, the ensemble-average (GDP per capita) growth rate is higher than the time-average…

Let $F_{n}$ and $L_n$ be the $n$th Fibonacci and Lucas number, respectively. For each positive integer $m$, the order of appearance of $m$ in the Fibonacci sequence, denoted by $z(m)$, is the smallest positive integer $k$ such that $m$…

We find a two term asymptotic expansion for the optimal expected value of a sequentially selected monotone subsequence from a random permutation of length n. A striking feature of this expansion is that tells us that the expected value of…

Let G be a group generated by $r$ elements $g_1,g_2,..., g_r.$ Among the reduced words in $g_1,g_2,..., g_r$ of length $n$ some, say $\gamma_n,$ represent the identity element of the group $G.$ It has been shown in a combinatorial way that…

This paper derives expressions for the growth rates for the random 2 x 2 matrices that result from solutions to the random Hill's equation. The parameters that appear in Hill's equation include the forcing strength and oscillation…

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…

Let $\be\in(1,2)$. Each $x\in I_\be:=[0,\frac{1}{\be-1}]$ can be represented in the form \[ x=\sum_{k=1}^\infty a_k\be^{-k}, \] where $a_k\in\{0,1\}$ for all $k$ (a $\be$-expansion of $x$). It was shown in \cite{S} that a.e. $x\in I_\be$…

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

In an evolutionary system in which the rules of mutation are local in nature, the number of possible outcomes after $m$ mutations is an exponential function of $m$ but with a rate that depends only on the set of rules and not the size of…

For a bilinear map $*:\mathbb R^d\times \mathbb R^d\to \mathbb R^d$ of nonnegative coefficients and a vector $s\in \mathbb R^d$ of positive entries, among an exponentially number of ways combining $n$ instances of $s$ using $n-1$…

In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent…

Zeckendorf proved that every positive integer can be expressed as the sum of non-consecutive Fibonacci numbers. This theorem inspired a beautiful game, the Zeckendorf Game. Two players begin with $n \ 1$'s and take turns applying rules…

We consider a model of interface growth in two dimensions, given by a height function on the sites of the one--dimensional integer lattice. According to the discrete time update rule, the height above the site $x$ increases to the height…

The close relationship among the polynomial functions and Fibonacci numerical sequences is shown in this paper. These numerical sequences are defined by the recurrence equation $x_{k + n} = \displaystyle\sum_{j = 0}^{n-1}\alpha_j x_{k +…

We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

Consider "lagged" Fibonacci sequences $a(n) = a(n-1)+a(\lfloor n/k\rfloor)$ for $k > 1$. We show that $\lim_{n\to\infty} a(kn)/a(n)\cdot\ln n/n = k\ln k$ and we demonstrate the slow numerical convergence to this limit and how to deal with…

We extend the results of B. Bollobas, O. Riordan, J. Spencer, G. Tusnady, and Mori. We consider a model of random tree growth, where at each time unit a new node is added and attached to an already existing node chosen at random. The…

We study the evolution leading to (or regressing from) a large fluctuation in a Statistical Mechanical system. We introduce and study analytically a simple model of many identically and independently distributed microscopic variables $n_m$…

For classes O of structures on finite linear orders (permutations, ordered graphs etc.) endowed with containment order cont (containment of permutations, subgraph relation etc.), we investigate restrictions on the function f(n) counting…

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…