Related papers: An elementary proof that random Fibonacci sequence…

In this case-study in computer-human collaboration, we develop, implement, and execute symbolic-computational algorithms for the automatic discovery and proof of explicit expressions for the expectation, variance, and higher moments of a…

In a base phi representation a natural number is written as a sum of powers of the golden mean $\varphi$. There are many ways to do this. How many? Even if the number of powers of $\varphi$ is finite, then any number has infinitely many…

An interesting open problem in number theory asks whether it is possible to walk to infinity on primes, where each term in the sequence has one more digit than the previous. In this paper, we study its variation where we walk on the…

Let $ k \geq 2 $ be an integer. The $ k- $generalized Fibonacci sequence is a sequence defined by the recurrence relation $ F_{n}^{(k)}=F_{n-1}^{(k)} + \cdots + F_{n-k}^{(k)}$ for all $ n \geq 2$ with the initial values $ F_{i}^{(k)}=0 $…

One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…

Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…

We consider strictly increasing sequences $\left(a_{n}\right)_{n \geq 1}$ of integers and sequences of fractional parts $\left(\left\{a_{n} \alpha\right\}\right)_{n \geq 1}$ where $\alpha \in \mathbb{R}$. We show that a small additive…

Answering a question of Erd\H{o}s and Graham, we show that the double exponential growth condition $\limsup_{n\to\infty}a_n^{1/\phi^n}=\infty$ for a strictly increasing sequence of positive integers $\{a_n\}_{n=1}^\infty$ is sufficient for…

We study a random bisection problem where an initial interval of length x is cut into two random fragments at the first stage, then each of these two fragments is cut further, etc. We compute the probability P_n(x) that at the n-th stage,…

We compute exact asymptotic results for the probability of the occurrence of large deviations of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we…

Let B be a p-uniformly convex Banach space, with p >= 2. Let T be a linear operator on B, and let A_n x denote the ergodic average (1 / n) sum_{i< n} T^n x. We prove the following variational inequality in the case where T is power bounded…

The circular $\beta$ ensemble for $\beta =1,2$ and 4 corresponds to circular orthogonal, unitary and symplectic ensemble respectively as introduced by Dyson. The statistical state of the eigenvalues is then a determinantal point process…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

The critical exponent of an infinite word $\bf x$ is the supremum, over all finite nonempty factors $f$, of the exponent of $f$. In this note we show that for all integers $k\geq 2,$ there is a binary infinite $k$-automatic sequence with…

Expansions in the Golden ratio base have been studied since a pioneering paper of R\'enyi more than sixty years ago. We introduce closely related expansions of a new type, based on the Fibonacci sequence, and we show that in some sense they…

Let $(X_n)_{n\in \mathbb{N}}$ be a sequence of i.i.d. random variables with distribution $\mathbb P(X_1=1)=\mathbb P(X_1=-1)=1/2$. Let $F(\sigma)=\sum_{n=1}^\infty X_nn^{-\sigma}$. We prove that the following holds almost surely…

Let $ p_{i, n}, i=1,..., N(n)=2^{n-1} $ be the lengths of intervals between the neighboring fractions of Brocot sequence $ F_n $. We obtain an asymptotic formula for $\sigma_{\beta}(F_n)=\sum_{i=1}^{N(n)} p_{i, n}^{\beta} $,which improves…

For a complexity function $C$, the lower and upper $C$-complexity rates of an infinite word $\mathbf{x}$ are \[ \underline{C}(\mathbf x)=\liminf_{n\to\infty} \frac{C(\mathbf{x}\upharpoonright n)}n,\quad \overline{C}(\mathbf…

We extend Fano's inequality, which controls the average probability of events in terms of the average of some $f$--divergences, to work with arbitrary events (not necessarily forming a partition) and even with arbitrary $[0,1]$--valued…

Preferential equality is an equivalence relation on fuzzy subsets of finite sets and is a generalization of classical equality of subsets. In this paper we introduce a tightened version of the preferential equality on fuzzy subsets and…