Related papers: Generalizing Zeckendorf's Theorem to f-decompositi…

In a recent paper, Frank Ruskey asked whether every linear recurrent sequence can occur in some solution of a meta-Fibonacci sequence. In this paper, we answer his question in the affirmative for recurrences with positive coefficients.

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

We provide conditions which yield a strong law of large numbers for expressions of the form $1/N\sum_{n=1}^{N}F\big(X(q_1(n)),..., X(q_\ell(n))\big)$ where $X(n),n\geq 0$'s is a sufficiently fast mixing vector process with some moment…

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…

The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…

Let $f$ be a normalized Hecke eigenform with rational integer Fourier coefficients. It is an interesting question to know how often an integer $n$ has a factor common with the $n$-th Fourier coefficient of $f$. The second author…

For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined by the initial values $0,0,...,0,1$ ($k$ terms) and such that each term afterwards is the sum of the $k$ preceding terms. In 2005, Noe and Post conjectured…

In this note we investigate the solutions of certain meta-Fibonacci recurrences of the form $f(n)=f(n-f(n-1))+f(n-2)$ for various sets of initial conditions. In the case when $f(n)=1$ for $n\leq 1$, we prove that the resulting integer…

Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is of type 1 if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…

For enumerative problems, i.e. computable functions f from N to Z, we define the notion of an effective (or closed) formula. It is an algorithm computing f(n) in the number of steps that is polynomial in the combined size of the input n and…

Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…

Let $C({\mathbb R}^n)$ denote the set of real valued continuous functions defined on ${\mathbb R}^n$. We prove that for every $n\ge 2$ there are positive numbers $\lambda _1 , \ldots , \lambda _n$ and continuous functions $\phi_1 ,\ldots ,…

For every nonnegative integer $n$, let $r_F(n)$ be the number of ways to write $n$ as a sum of Fibonacci numbers, where the order of the summands does not matter. Moreover, for all positive integers $p$ and $N$, let \begin{equation*}…

The well-known Zalcman conjecture, which implies the Bieberbach conjecture, states that the coefficients of univalent functions $f(z) = z + \sum\limits_2^{\infty} a_n z^n$ on the unit disk satisfy $|a_n^2 - a_{2n-1}| \le (n-1)^2$ for all $n…

For each positive integer $n$, function $f$, and point $c$, the GGR Theorem states that $f$ is $n$ times Peano differentiable at $c$ if and only if $f$ is $n-1$ times Peano differentiable at $c$ and the following $n$-th generalized…

Given a random sequence of holomorphic maps $f_1,f_2,f_3,...$ of the unit disk $\Delta$ to a subdomain $X$, we consider the compositions $$F_n=f_1 \circ f_{2} \circ ... f_{n-1} \circ f_n.$$ The sequence $\{F_n\}$ is called the {\em iterated…

For a class $F$ of complex-valued functions on a set $D$, we denote by $g_n(F)$ its sampling numbers, i.e., the minimal worst-case error on $F$, measured in $L_2$, that can be achieved with a recovery algorithm based on $n$ function…

Goodstein sequences are numerical sequences in which a natural number m, expressed as the complete normal form to a given base a, is modified by increasing the value of the base a by one unit and subtracting one unit from the resulting…

Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…