English
Related papers

Related papers: Solving Skolem problem for negative indexed $k-$ge…

200 papers

For any integer $k \geq 2$, let $\{Q_{n}^{(k)} \}_{n \geq -(k-2)}$ denote the $k$-generalized Pell-Lucas sequence which starts with $0, \dots ,2,2$($k$ terms) where each next term is the sum of the $k$ preceding terms. In this paper, we…

Number Theory · Mathematics 2023-03-10 Bibhu Prasad Tripathy , Bijan Kumar Patel

The Skolem Problem asks to determine whether a given linear recurrence sequence (LRS) $\langle u_n \rangle_{n=0}^\infty$ over the integers has a zero term, that is, whether there exists $n$ such that $u_n = 0$. Decidability of the problem…

Computational Complexity · Computer Science 2025-10-27 Piotr Bacik , Joël Ouaknine , James Worrell

We study a generalization of Pell's equation, whose coefficients are certain algebraic integers. Let $X_0=0$ and $X_n=\sqrt{2+X_{n-1}}$ for each $n\in \mathbb{Z}_{\ge 1}$. We study the $\mathbb{Z}[X_{n-1}]$-solutions of the equation…

Number Theory · Mathematics 2022-11-28 Hyuga Yoshizaki

For any integer $k$, M.Kaneko defined $k$-th poly-Bernoulli numbers as a kind of generalization of classical Bernoulli numbers using $k$-th polylogarithm. In case when $k$ is positive, $k$-th poly-Bernoulli numbers is a sequence of rational…

Number Theory · Mathematics 2024-09-30 Yasuo Ohno , Mika Sakata

For an integer $k\geq 2$, let $\{F^{(k)}_{n}\}_{n\geqslant 2-k}$ be the $ k$--generalized Fibonacci sequence which starts with $0, \ldots, 0,1$ (a total of $k$ terms) and for which each term afterwards is the sum of the $k$ preceding terms.…

Number Theory · Mathematics 2018-04-10 Mahadi Ddamulira , Florian Luca

The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros of a linear recurrence sequence is the union of a finite set and finitely many arithmetic progressions. The corresponding computational question, the Skolem Problem,…

Logic in Computer Science · Computer Science 2022-04-29 Yuri Bilu , Florian Luca , Joris Nieuwveld , Joël Ouaknine , David Purser , James Worrell

For any integer $k \geq 2$, let $\{Q_{n}^{(k)} \}_{n \geq -(k-2)}$ denote the $k$-generalized Pell-Lucas sequence which starts with $0, \dots ,2,2$($k$ terms) where each next term is the sum of the $k$ preceding terms. In this paper, we…

Number Theory · Mathematics 2022-11-15 Bibhu Prasad Tripathy , Bijan Kumar Patel

In this paper, generalized Bell polynomials $(\Be_n^\phi)_n$ associated to a sequence of real numbers $\phi=(\phi_i)_{i=1}^\infty$ are introduced. Bell polynomials correspond to $\phi_i=0$, $i\ge 1$. We prove that when $\phi_i\ge 0$, $i\ge…

Classical Analysis and ODEs · Mathematics 2024-09-18 Antonio J. Durán

Suppose that $\langle f_n \rangle$ is a sequence of polynomials, $\langle f_n^{(k)}(0)\rangle$ converges for every non-negative integer $k$, and that the limit is not $0$ for some $k$. It is shown that if all the zeros of $f_1, f_2, \dots$…

Complex Variables · Mathematics 2019-03-05 Min-Hee Kim , Young-One Kim , Jungseob Lee

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

Number Theory · Mathematics 2015-05-28 Jason P. Bell , Stanley N. Burris , Karen Yeats

In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…

Number Theory · Mathematics 2018-10-03 Min Sha

Let $k\geq 2$ and let $(P_{n}^{(k)})_{n\geq 2-k}$ be $k$-generalized Pell sequence defined by \begin{equation*}P_{n}^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+...+P_{n-k}^{(k)}\end{equation*} for $n\geq 2$ with initial conditions…

Number Theory · Mathematics 2020-09-29 Zafer Şiar , Refik Keskin

In this paper, we find all the solutions of the Diophantine equation $P_\ell + P_m +P_n=2^a$, in nonnegative integer variables $(n,m,\ell, a)$ where $P_k$ is the $k$-th term of the Pell sequence $\{P_n\}_{n\ge 0}$ given by $P_0=0$, $P_1=1$…

Number Theory · Mathematics 2016-08-23 Jhon J. Bravo , Bernadette Faye , Florian Luca

We consider the greatest common divisor (GCD) of all sums of $k$ consecutive terms of a sequence $(S_n)_{n\geq 0}$ where the terms $S_n$ come from exactly one of following six well-known sequences' terms: Pell $P_n$, associated Pell $Q_n$,…

Number Theory · Mathematics 2023-06-29 aBa Mbirika , Janee Schrader , Jürgen Spilker

Let $X_1,X_2,\ldots$ be independent and identically distributed random variables in $\mathbb{C}$ chosen from a probability measure $\mu$ and define the random polynomial $$ P_n(z)=(z-X_1)\ldots(z-X_n)\,. $$ We show that for any sequence $k…

Probability · Mathematics 2022-12-23 Marcus Michelen , Xuan-Truong Vu

In this note, we establish a multiplicity theorem for a nonlocal discrete problem of the type $$\cases{-\left(a\sum_{m=1}^{n+1}|x_m-x_{m-1}|^2+b\right)(x_{k+1}-2x_k+x_{k-1})=h_k(x_k)\hskip 10pt k=1,...,n, \cr & \cr x_0=x_{n+1}=0\cr}$$…

Classical Analysis and ODEs · Mathematics 2025-05-20 Biagio Ricceri

Let k>=2 and let (Q_{n}^{(k)})_{n>=2-k} be the k-generalized Pell sequence defined by Q_{n}^{(k)}=2Q_{n-1}^{(k)}+Q_{n-2}^{(k)}+...+Q_{n-k}^{(k)} for n>=2 with initial conditions Q_{-(k-2)}^{(k)}=Q_{-(k-3)}^{(k)}=...=Q_{-1}^{(k)}=0,…

Number Theory · Mathematics 2022-09-12 Zafer Şiar , Refik Keskin

By applying the Newton-Gregory expansion to the polynomial associated with the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$, we derive a couple of infinite families of explicit formulas for $S_k(n)$. One of the families…

Number Theory · Mathematics 2022-12-06 José L. Cereceda

We consider certain generalized binomial sums $\mathcal{S}_{(r,n)}(\ell)$ and discuss the nonintegrality of their values for integral parameters $n,r \geq 1$ and $\ell \in \mathbb{Z}$ in several cases using $p$-adic methods. In particular,…

Number Theory · Mathematics 2023-08-23 Bernd C. Kellner

Let $r$ and $k$ be positive integers with $r \mid k$. Denote by $S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every coloring $\chi:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to $\sum_{i=1}^{k-1} x_i = x_k$…

Combinatorics · Mathematics 2018-02-12 Aaron Robertson