English
Related papers

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

200 papers

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

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

This paper finds all Lucas numbers which are the sum of two Jacobsthal numbers. It also finds all Jacobsthal numbers which are the sum of two Lucas numbers. In general, we find all non-negative integer solutions $(n, m, k)$ of the two…

Number Theory · Mathematics 2024-10-17 Osama Salah , A. Elsonbaty , Mohammed Abdul Azim Seoud , Mohamed Anwar

Let $(U_{n}(P,Q) $ and $(V_{n}(P,Q) $ denote the generalized Fibonacci and Lucas sequence, respectively. In this study, we assume that $Q=1.$ We determine all indices $n$ such that $U_{n}=5\square $ and $U_{n}=5U_{m}\square $ under some…

Number Theory · Mathematics 2012-06-20 Refik Keskin , Olcay Karaatlı

A Skolem sequence is a sequence a_1,a_2,...,a_2n (where a_i \in A = {1,...,n }), each a_i occurs exactly twice in the sequence and the two occurrences are exactly a_i positions apart. A set A that can be used to construct Skolem sequences…

Combinatorics · Mathematics 2007-05-23 Gustav Nordh

In these notes we study the $k$-generalized Fibonacci sequences - $(F_n^{(k)})_{n\in \Z}$ - with positive and negative indices. Denote $T_k(x)$ its characteristic polynomial. Our most interesting finding is that if $k$ is even then the…

Number Theory · Mathematics 2020-08-26 Attila Pethő

Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…

Number Theory · Mathematics 2021-08-10 Carlo Sanna

Harmonic numbers $H_k=\sum_{0<j\le k}1/j (k=0,1,2,...)$ arise naturally in many fields of mathematics. In this paper we initiate the study of congruences involving both harmonic numbers and Lucas sequences. One of our three theorems is as…

Number Theory · Mathematics 2011-05-24 Zhi-Wei Sun

Based on the concepts of a generalized critical point and the corresponding generalized P.S. condition introduced by Duong Minh Duc[1], we have proved a new $Z_2$ index theorem and get a result on multiplicity of generalized critical…

Analysis of PDEs · Mathematics 2007-05-23 Zhujun Zheng , Keping Lu , Luo Xuebo

Let $ \{L_n\}_{n\geq 0} $ be the sequence of Lucas numbers. In this paper, we determine all Lucas numbers that are palindromic concatenations of two distinct repdigits.

General Mathematics · Mathematics 2024-01-12 Herbert Batte

We present the exact solution for a set of nonlinear algebraic equations $\frac{1}{z_l}= \pi d + \frac{2 d}{n} \sum_{m \neq l} \frac{1}{z_l-z_m}$. These were encountered by us in a recent study of the low energy spectrum of the Heisenberg…

Condensed Matter · Physics 2009-11-07 B. Sriram Shastry , Abhishek Dhar

For almost a century, the decidability of the Skolem Problem - that is, the problem of finding whether a given linear recurrence sequence (LRS) has a zero term - has remained open. A breakthrough in the 1980s established that the Skolem…

Formal Languages and Automata Theory · Computer Science 2025-12-10 Piotr Bacik

For an integer $k \geq 2$, let $\{ P_{n}^{(k)} \}_{n}$ be the $k$-generalized Pell sequence which starts with $0, \dots,0,1$($k$ terms) and each term afterwards is the sum of $k$ preceding terms. In this paper, we find all the solutions of…

Number Theory · Mathematics 2023-07-11 Bibhu Prasad Tripathy , Bijan Kumar Patel

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

We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence. In particular, we show that the continuous version of the…

Dynamical Systems · Mathematics 2009-04-23 Paul Bell , Jean-Charles Delvenne , Raphael Jungers , Vincent D. Blondel

Motivated by the study of the distribution of zeros of generalized Bessel-type functions, the principal goal of this paper is to identify new research directions in the theory of multiplier sequences. The investigations focus on multiplier…

Complex Variables · Mathematics 2015-10-20 George Csordas , Tamás Forgács

We introduce a new variant of the $k$-deck problem, which in its traditional formulation asks for determining the smallest $k$ that allows one to reconstruct any binary sequence of length $n$ from the multiset of its $k$-length…

Information Theory · Computer Science 2017-01-30 Ryan Gabrys , Olgica Milenkovic

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

For Lucas sequences of the first kind (u_n) and second kind (v_n) defined as usual for positive n by u_n=(a^n-b^n)/(a-b), v_n=a^n+b^n, where a and b are either integers or conjugate quadratic integers, we describe the set of indices n for…

Number Theory · Mathematics 2009-08-27 Chris Smyth

Let $(u_n)_{n \geq 0}$ be a non-degenerate Lucas sequence, given by the relation $u_n=a_1 u_{n-1}+a_2 u_{n-2}$. Let $\ell_u(m)=lcm(m, z_u(m))$, for $(m,a_2)=1$, where $z_u(m)$ is the rank of appearance of $m$ in $u_n$. We prove that…

Number Theory · Mathematics 2019-01-08 Daniele Mastrostefano