Related papers: Structure and Growth of Galileo Sequences
Golomb's sequence is the unique nondecreasing sequence of positive integers in which each $n$ appears exactly $a(n)$ times. It satisfies the global self-referential rule \[ a\bigl(a(n)+a(n-1)+\cdots+a(1)\bigr)=n, \] grows smoothly like a…
The Galileon model is a modified gravity theory that may provide an explanation for the accelerated expansion of the Universe. This model does not suffer from instabilities or ghost problems (normally associated with higher-order derivative…
We introduce a class of stochastic integer sequences. In these sequences, every element is a sum of two previous elements, at least one of which is chosen randomly. The interplay between randomness and memory underlying these sequences…
We show generic existence of power series a with complex coefficients a_n, such that the sequence of partial sums of a new power series where its coefficients b_n are functions of a_0, a_1, ..., a_n approximate every polynomial uniformly on…
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…
The Galileon model is a tensor-scalar theory of gravity which explains the late acceleration of the Universe expansion with no instabilities and recovers General Relativity in the strong field limit. Most constraints obtained so far on…
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…
An important result of H. Weyl states that for every sequence $\left(a_{n}\right)_{n \geq 1}$ of distinct positive integers the sequence of fractional parts of $\left(a_{n} \alpha \right)_{n\geq 1}$ is uniformly distributed modulo one for…
For any integer s >= 0, we derive a combinatorial interpretation for the family of sequences generated by the recursion (parameterized by s) h_s(n) = h_s(n - s - h_s(n - 1)) + h_s(n - 2 - s - h_s(n - 3)), n > s + 3, with the initial…
A good range of problems on trees can be described by the following general setting: Given a bilinear map $*:\mathbb R^d\times\mathbb R^d\to\mathbb R^d$ and a vector $s\in\mathbb R^d$, we need to estimate the largest possible absolute value…
We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.
Galileon gravity offers a robust gravitational theory for explaining cosmic acceleration, having a rich phenomenology of testable behaviors. We explore three classes of Galileon models -- standard uncoupled, and linearly or derivatively…
This paper presents a new generalization of the Genocchi numbers and the Genocchi theorem. As consequences, we obtain some important families of integer-valued polynomials those are closely related to the Bernoulli polynomials. Denoting by…
The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…
A positive linear recurrence sequence is of the form $H_{n+1} = c_1 H_n + \cdots + c_L H_{n+1-L}$ with each $c_i \ge 0$ and $c_1 c_L > 0$, with appropriately chosen initial conditions. There is a notion of a legal decomposition (roughly,…
We consider integer sequences that satisfy a recursion of the form $x_{n+1} = P(x_n)$ for some polynomial $P$ of degree $d > 1$. If such a sequence tends to infinity, then it satisfies an asymptotic formula of the form $x_n \sim A…
Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…
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…
A sequence of positive integers $(a_1,a_2,\ldots,a_k)$ is called $\ell$-additive if $a_1+a_2+\cdots+a_k=\ell a_1$ or $\ell a_k$. In this paper, we prove that for all $k\geq3$, if $n$ is sufficiently large, then every permutation of…
A subset of positive integers $F$ is a Schreier set if it is non-empty and $|F|\leqslant \min F$ (here $|F|$ is the cardinality of $F$). For each positive integer $k$, we define $k\mathcal{S}$ as the collection of all the unions of at most…