Related papers: Almost-sure Growth Rate of Generalized Random Fibo…

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$…

Let $F(p)$, $p\ge2$ be the family of generalized Thompson's groups. Here F(2) is the famous Richard Thompson's group usually denoted by $F$. We find the growth rate of the monoid of positive words in $F(p)$ and show that it does not exceed…

We present new expressions for the $k$-generalized Fibonacci numbers, say $F_k(n)$. They satisfy the recurrence $F_k(n) = F_k(n-1) +\dots+F_k(n-k)$. Explicit expressions for the roots of the auxiliary (or characteristic) polynomial are…

We study the growth rate of the inclusion length of an almost periodic function. For a given a. p. function such growth rate depends on the algebraic structure of Fourier exponents, i. e. on how good they can be approximated by rational…

Let $\alpha(\mathbb{F}_q^d,p)$ denote the maximum size of a general position set in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^2,p)$ up to polylogarithmic factors for all possible…

For each positive integer $k$, let $\mathscr{A}_k$ be the set of all positive integers $n$ such that $\gcd(n, F_n) = k$, where $F_n$ denotes the $n$th Fibonacci number. We prove that the asymptotic density of $\mathscr{A}_k$ exists and is…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we solve all powers of two which are sums of four Fibonacci numbers with a few exceptions that we…

Each positive increasing integer sequence $\{a_n\}_{n\geq 0}$ can serve as a numeration system to represent each non-negative integer by means of suitable coefficient strings. We analyse the case of $k$-generalized Fibonacci sequences…

We study ratio limits of the consecutive terms of weighted $n$-generalized Fibonacci sequences generated from arbitrary complex initial conditions by linear recurrences with arbitrary complex weights. We prove that if the characteristic…

Generalizing some popular sequences like Catalan's number, Schr\"oder's number, etc, we consider the sequence $s_n$ with $s_0=1$ and for $n\ge 1$, \begin{multline*} s_n=\sum_{x_1+\dots+x_{\ell_1}=n-1} \kappa_1 s_{x_1}\dots s_{x_{\ell_1}} +…

Given that $a,b\in\mathbb N$, $c_0,c_1\in\mathbb Z$, $(c_0,c_1)\neq (0,0)$, and a generalized Fibonacci sequence $(s_n)_{n\geq 0}$ where $s_0 = c_0$, $s_1 = c_1$, and $s_{n+1}=as_{n}+bs_{n-1}$ for all positive integers $n$. In this paper,…

In this paper we show that, if an increasing sequence $\Lambda=(\lambda_k)_{k\in\mathbb{Z}}$ has gaps going to infinity $\lambda_{k+1}-\lambda_k\to +\infty$ when $k\to\pm\infty$, then for every $T>0$ and every sequence…

Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…

Gijswijt's sequence consists almost entirely of small positive integers. However, it is known that every positive integer eventually appears in the sequence. In this paper we determine its growth rate. Specifically, we prove that for…

We consider long-range percolation on $\mathbb{Z}^d$, where the probability that two vertices at distance $r$ are connected by an edge is given by $p(r)=1-\exp[-\lambda(r)]\in(0,1)$ and the presence or absence of different edges are…

We present a new approach to showing that random graphs are nearly optimal expanders. This approach is based on recent deep results in combinatorial group theory. It applies to both regular and irregular random graphs. Let G be a random…

This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…

By Zeckendorf's Theorem, every positive integer is uniquely written as a sum of distinct non-adjacent Fibonacci terms. In this paper, we investigate the asymptotic formula of the number of binary expansions $<x$ that have no adjacent terms,…

Given two sets of positive integers $A$ and $B$, let $AB := \{ab : a \in A,\, b \in B\}$ be their product set and put $A^k := A \cdots A$ ($k$ times $A$) for any positive integer $k$. Moreover, for every positive integer $n$ and every…

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…