Related papers: Completeness of Positive Linear Recurrence Sequenc…

Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…

We characterize sequences of numbers $(a_n)$ such that $\sum_{n\geq 1} a_n\Phi_n$ converges a.e. for any orthonormal system $(\Phi_n)$ in any $L_2$-space. In our criterion, we use the set $B =\{\sum_{m\geq n} |a_m|^2; n\geq 1\}$ and its…

We present a common sufficient condition for the total positivity of combinatorial triangles and their reversals, as well as the real-rootedness of generating functions of the rows. The proof technique is to construct a unified planar…

Let $\epsilon\in \{-1,1\}$. A sequence of prime numbers $p_1, p_2, p_3, ...$, such that $p_i=2p_{i-1}+\epsilon$ for all $i$, is called a {\it Cunningham chain} of the first or second kind, depending on whether $\epsilon =1$ or -1…

Consider the celebrated Lyness recurrence $x_{n+2}=(a+x_{n+1})/x_{n}$ with $a\in\Q$. First we prove that there exist initial conditions and values of $a$ for which it generates periodic sequences of rational numbers with prime periods…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

The results of Bergelson-Host-Kra and Leibman say that a multiple polynomial correlation sequence can be decomposed into a sum of a nilsequence (a sequence defined by evaluating a continuous function along an orbit in a nilsystem) and a…

A linear equation is $r$-regular, if, for every $r$-coloring of the positive integers, there exist positive integers of the same color which satisfy the equation. In 2005, Fox and Radoicic conjectured that the equation $x_1 + 2x_2 + \cdots…

Somos 4 sequences are a family of sequences defined by a fourth-order quadratic recurrence relation with constant coefficients. For particular choices of the coefficients and the four initial data, such recurrences can yield sequences of…

In this paper, we consider higher order paired symmetric tensors and strongly paired symmetric tensors. Elasticity tensors and higher order elasticity tensors in solid mechanics are strongly paired symmetric tensors. A (strongly) paired…

In the first series "Special functions and three term recurrence formula (3TRF)", I show how to obtain power series solutions of Heun, Grand Confluent Hypergeoemtric (GCH), Mathieu and Lame equations for an infinite series and a polynomial…

In this paper we prove that for any infinite word W whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes are palindromes; (II) P(n) + P(n+1) = C(n+1) - C(n) + 2 for…

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

In literature, there are two different definitions of elliptic divisibility sequences. The first one says that a sequence of integers $\{h_n\}_{n\geq 0}$ is an elliptic divisibility sequence if it verifies the recurrence relation…

We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…

We consider the problem of sequencing a set of positive numbers. We try to find the optimal sequence to maximize the variance of its partial sums. The optimal sequence is shown to have a beautiful structure. It is interesting to note that…

We prove that a non-degenerate simple linear recurrence sequence $ (G_n(x))_{n=0}^{\infty} $ of polynomials satisfying some further conditions cannot contain arbitrary large powers of polynomials if the order of the sequence is at least…

Let $A=[a_{n,k}]_{n,k\ge 0}$ be an infinite lower triangular matrix defined by the recurrence $$a_{0,0}=1,\quad a_{n+1,k}=r_{k}a_{n,k-1}+s_{k}a_{n,k}+t_{k+1}a_{n,k+1},$$ where $a_{n,k}=0$ unless $n\ge k\ge 0$ and $r_k,s_k,t_k$ are all…

Let $S = \{q_1, \ldots , q_s\}$ be a finite, non-empty set of distinct prime numbers. For a non-zero integer $m$, write $m = q_1^{r_1} \ldots q_s^{r_s} M$, where $r_1, \ldots , r_s$ are non-negative integers and $M$ is an integer relatively…