Related papers: Resolution of the Skolem Problem for $k$-Generaliz…

Let $K$ be a field of characteristic zero and suppose that $f:\mathbb{N}\to K$ satisfies a recurrence of the form $$f(n)\ =\ \sum_{i=1}^d P_i(n) f(n-i),$$ for $n$ sufficiently large, where $P_1(z),...,P_d(z)$ are polynomials in $K[z]$.…

Let $T_{k}$ be the $k^{\textrm{th}}$ Tribonacci number and $L_{n}$ be the $n^{\textrm{th}}$ Lucas number defined by their respective recurrence relation $T_{k}=T_{k-1}+T_{k-2}+T_{k-3}$ and $L_{n}=L_{n-1}+L_{n-2}$. In this study, we solve…

Let $z_1, \dots, z_m$ be $m$ distinct complex numbers, normalized to $|z_k| = 1$, and consider the polynomial $$ p_{m}(z) = \prod_{k=1}^{m}{(z-z_k)}.$$ We define a sequence of polynomials in a greedy fashion, $$ p_{N+1}(z) = p_{N}(z)…

In this paper we define a new problem, motivated by computational biology, $LCSk$ aiming at finding the maximal number of $k$ length $substrings$, matching in both input strings while preserving their order of appearance. The traditional…

Given a nondecreasing sequence $\Lambda=\{\lambda_n>0\}$ such that $\displaystyle\lim_{n\to\infty} \lambda_n=\infty,$ we consider the sequence $\mathcal N_\Lambda:=\left\{\lambda_ne^{i\theta_n},n\in\,\mathbb N\right\}$, where $\theta_n$ are…

We study multiplicative dependence between terms of the $k$-generalized Pell sequence $(P_n^{(k)})_{n\ge 2-k}$, defined by the linear recurrence \[ P_n^{(k)} = 2P_{n-1}^{(k)} + P_{n-2}^{(k)} + \dots + P_{n-k}^{(k)}, \] with initial…

A zero-sum sequence of integers is a sequence of nonzero terms that sum to 0. Let $k>0$ be an integer and let $[-k,k]$ denote the set of all nonzero integers between $-k$ and $k$. Let $\ell(k)$ be the smallest integer $\ell$ such that any…

Let $(L_n)_{n\geq 0}$ be the Lucas sequence given by $L_0 = 2, L_1 = 1$ and $L_{n+2} = L_{n+1}+L_n$ for $n \geq 0$. In this paper, we are interested in finding all powers of three which are sums of two Lucas numbers, i.e., we study the…

We give a generalization of Wolstenholme's harmonic series congruence for the Lucas sequences.

We present a new method for proving non-holonomicity of sequences, which is based on results about the number of zeros of elementary and of analytic functions. Our approach is applicable to sequences that are defined as the values of an…

Let A be a zero-sum free subset of Z_n with |A|=k. We compute for k\le 7 the least possible size of the set of all subset-sums of A.

We introduce a generalized similarity analysis which grants a qualitative description of the localised solutions of any nonlinear differential equation. This procedure provides relations between amplitude, width, and velocity of the…

We consider the generalized Lebesgue-Ramanujan-Nagell equation $x^2+17^k41^\ell 59^m=2^\delta y^n$ in the unknown integers $x\geq 1, y>1,n\geq 3$ and $k, \ell, m\geq 0$ satisfying $\gcd(x,y)=1$. We first find all the integer solutions of…

Assuming the generalized Riemann hypothesis and a bound for the negative discrete moments of the Riemann zeta function (resp. Dirichlet $L$-functions), we prove the existence of a logarithmic limiting distribution for the normalized partial…

Let $k\ge 2$ and $\{L_n^{(k)}\}_{n\geq 2-k}$ be the sequence of $k$-Lucas numbers whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we solve the Diophantine equation…

We compute the number of solutions to the Skolem pairings problem, S(n), and to the Langford variant of the problem, L(n). These numbers correspond to the sequences A059106, and A014552 in Sloane's Online Encyclopedia of Integer Sequences.…

For $A,B\in\mathbb Z$, the Lucas sequence $u_n(A,B)\ (n=0,1,2,\ldots)$ are defined by $u_0(A,B)=0$, $u_1(A,B)=1$, and $u_{n+1}(A,B) = Au_n(A,B)-Bu_{n-1}(A,B)$ $(n=1,2,3,\ldots).$ For any odd prime $p$ and positive integer $n$, we establish…

We consider the following variant of the Mortality Problem: given $k\times k$ matrices $A_1, A_2, \dots,A_{t}$, does there exist nonnegative integers $m_1, m_2, \dots,m_t$ such that the product $A_1^{m_1} A_2^{m_2} \cdots A_{t}^{m_{t}}$ is…

This paper presents an algorithm to solve the Soft k-Means problem globally. Unlike Fuzzy c-Means, Soft k-Means (SkM) has a matrix factorization-type objective and has been shown to have a close relation with the popular probability…

Let $\{U_n\}_{n\geq 0}$ be a Lucas sequence. Then the equation $$|U_n|=m_1!m_2!\cdots m_k!$$ with $1<m_1\leq m_2\leq \cdots\leq m_k$ implies $n\in \{1,2, 3, 4, 6, 8, 12\}$. Further the equation $$|U_n|=D_{m_1}D_{m_2}\cdots D_{m_k}, \qquad…