Related papers: An elementary proof that random Fibonacci sequence…

We study the random Fibonacci tree, which is an infinite binary tree with non-negative integers at each node. The root consists of the number 1 with a single child, also the number 1. We define the tree recursively in the following way: if…

For any $\beta > 1$, denoted by $r_n(x,\beta)$ the maximal length of consecutive zeros amongst the first $n$ digits of the $\beta$-expansion of $x\in[0,1]$. The limit superior (respectively limit inferior) of $\frac{r_n(x,\beta)}{n}$ is…

Let $F_n$ be the $n$th Fibonacci number. Let $m, n$ be positive integers. Define a sequence $(G(k,n,m))_{k\geq 1}$ by $G(1,n,m) = F^m_n$, and $G(k+1,n,m) = F_{nG(k,n,m)}$ for all $k\geq 1$. We show that $F_n^{k+m-1}\mid G(k,n,m)$ for all…

In this paper we introduce and discuss the sequence of \emph{real numbers} defined as $u_0 \in \mathbb R$ and $u_{n+1} = \Delta(u_n)$ where \begin{equation*} \Delta(x) = \begin{cases} \frac{x}{2} &\text{if }…

Let $X_{nr}$ be the $r$th largest of a random sample of size $n$ from a distribution $F (x) = 1 - \sum_{i = 0}^\infty c_i x^{-\alpha - i \beta}$ for $\alpha > 0$ and $\beta > 0$. An inversion theorem is proved and used to derive an…

We study sequences $(x_n)_{n=1}^{\infty}$ of reals given by $x_{n+1} = f(x)$ where $$f(x) = x - \sum_{i=1}^{m} \frac{\alpha_i}{x - \beta_i},$$ where $\alpha_1, \dots, \alpha_m \in \mathbb{R}_{>0}$ and $\beta_1, \dots, \beta_m \in…

Let $I_n(x)=\prod_{i=1}^n \left( 1+x^{F_{i+1}}\right)$, where $F_{i+1}$ denotes a Fibonacci number. Let $v_r(n)$ denote the sum of the $r$th powers of the coefficients of $I_n(x)$. Our prototypical result is that $\sum_{n\geq 0} v_2(n)x^n=…

In this study, we investigate the form of solutions, stability character and asymptotic behavior of the following rational difference equation x_{n+1}=({\gamma}/(x_{n}(x_{n-1}+{\alpha})+\b{eta})), n=0,1,..., where the inital values x_{-1}…

We dedicate this paper to investigate the most generalized form of Fibonacci Sequence, one of the most studied sections of the mathematical literature. One can notice that, we have discussed even a more general form of the conventional one.…

The $n$-th Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by binary strings with no two consecutive ones. We determine $\pi(\Gamma_n) = 2^n$ for $n \le 6$, so the pebbling number of $\Gamma_n$ equals that of the…

Let $\{A_{i,n}\}$ be a triangular array of elements in a Banach algebra, whose norms do not grow too fast, and whose row averages converge to $A$. Let $\sigma \in S(n)$ be a permutation drawn uniformly at random. If the array only contains…

Given $\beta\in(1,2)$ and $x\in[0,\frac{1}{\beta-1}]$, a sequence $(\epsilon_{i})_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is called a $\beta$-expansion for $x$ if $$x=\sum_{i=1}^{\infty}\frac{\epsilon_{i}}{\beta^{i}}.$$ In a recent article…

We consider the rate of convergence of the expected loss of empirically optimal vector quantizers. Earlier results show that the mean-squared expected distortion for any fixed distribution supported on a bounded set and satisfying some…

This papers contains two results concerning random $n \times n$ Bernoulli matrices. First, we show that with probability tending to one the determinant has absolute value $\sqrt {n!} \exp(O(\sqrt(n log n)))$. Next, we prove a new upper…

The sequence of partial sums of Fibonacci numbers, beginning with $2$, $4$, $7$, $12$, $20$, $33,\dots$, has several combinatorial interpretations (OEIS A000071). For instance, the $n$-th term in this sequence is the number of length-$n$…

The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. In this paper, we get the explicit expressions of all squares and cubes, then we determine the number of distinct squares and cubes…

We consider a simple model of a growing cluster of points in $\Re^d,d\geq 2$. Beginning with a point $X_1$ located at the origin, we generate a random sequence of points $X_1,X_2,\ldots,X_i,\ldots,$. To generate $X_{i},i\geq 2$ we choose a…

The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. Since $\mathbb{F}$ is uniformly recurrent, each factor $\omega$ appears infinite many times in the sequence which is arranged as…

We consider the asymptotics of sums of the form $$ \frac1{F_n^\sigma} \sum_{m = 1}^{F_n-1} \frac{f(m/F_n)}{\left|{\sin(\pi m/F_n)}\right|^\sigma} \frac{f(F_{n-1}m/F_n)}{\left|{\sin(\pi F_{n-1}m/F_n)}\right|^\sigma} $$ where $(F_n)_{n \in…

Let $1<\beta<2$. Given any $x\in[0, (\beta-1)^{-1}]$, a sequence $(a_n)\in\{0,1\}^{\mathbb{N}}$ is called a $\beta$-expansion of $x$ if $x=\sum_{n=1}^{\infty}a_n\beta^{-n}.$ For any $k\geq 1$ and any $(b_1b_2\cdots b_k)\in\{0,1\}^{k}$, if…