English
Related papers

Related papers: On Positivity and Minimality for Second-Order Holo…

200 papers

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

Logic in Computer Science · Computer Science 2026-03-12 Ruiwen Dong , Doron Shafrir

We investigate the generalized moment membership problem for matrices, a formulation equivalent to Skolem's problem for linear recurrence sequences. We show decidability for orthogonal, unitary, and real eigenvalue matrices, and…

Algebraic Geometry · Mathematics 2025-05-28 Gemma De les Coves , Joshua Graf , Andreas Klingler , Tim Netzer

We consider a sequence of polynomials $\{P_n\}_{n \geq 0}$ satisfying a special $R_{II}$ type recurrence relation where the zeros of $P_n$ are simple and lie on the real line. It turns out that the polynomial $P_n$, for any $n \geq 2$, is…

Classical Analysis and ODEs · Mathematics 2017-03-16 Mourad E. H. Ismail , Alagacone Sri Ranga

Hypergeometric sequences are rational-valued sequences that satisfy first-order linear recurrence relations with polynomial coefficients; that is, $\langle u_n \rangle_{n=0}^\infty$ is hypergeometric if it satisfies a first-order linear…

Logic in Computer Science · Computer Science 2024-04-25 George Kenison

We investigate the arithmetic nature of P-recursive sequences through the lens of their D-finite generating functions. Building on classical tools from differential algebra, we revisit the integrality criterion for Motzkin-type sequences…

Number Theory · Mathematics 2025-11-05 Anastasia Matveeva

Let ${\nu}_q(n)$ be the p-adic valuation of $n$. We show that the power series with coefficients ${\nu}_q(n)$, respectively ${\nu}_p(n)(\mathrm{ mod\;} k)$, are non-holonomic and not algebraic in characteristic 0. We find infinitely many…

Number Theory · Mathematics 2024-12-24 Cristian Cobeli , Mihai Prunescu , Alexandru Zaharescu

Second order recurrence relations of real numbers arise form various applications in discrete time dynamical systems as well as in the context on Markov chains. Solutions to the recurrence relations are fully defined by the first two…

Combinatorics · Mathematics 2022-08-18 Jens Walter Fischer

In this paper, we study the periodicity structure of finite field linear recurring sequences whose period is not necessarily maximal and determine necessary and sufficient conditions for the characteristic polynomial~\(f\) to have exactly…

Combinatorics · Mathematics 2021-03-02 Ghurumuruhan Ganesan

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,…

Number Theory · Mathematics 2016-07-19 Steven J. Miller , Dawn Nelson , Zhao Pan , Huanzhong Xu

We consider $\ell$-log-momotonic sequences and Laguerre inequality of order two for sequences $\{a_n\}_{n \ge 0}$ such that \[ \frac{a_{n-1}a_{n+1}}{a_n^2} = 1 + \sum_{i=1}^m \frac{r_i(\log n)}{n^{\alpha_i}} + o\left( \frac{1}{n^{\beta}}…

Combinatorics · Mathematics 2022-06-29 Guo-Jie Li

We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…

Symbolic Computation · Computer Science 2013-06-19 Marc Mezzarobba , Bruno Salvy

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several interesting identities involving this sequence such as $F_n^2+F_{n+1}^2=F_{2n+1}$, for all $n\geq…

Number Theory · Mathematics 2023-09-18 Ana Paula Chaves , Carlos Gustavo Moreira , Eduardo Henrique no Nascimento

We establish a sufficient condition for the ultimate positivity of P-recursive sequences of arbitrary order with a unique dominant root. By additionally verifying finitely many initial terms, the positivity can also be resolved. As an…

Combinatorics · Mathematics 2026-05-19 Zhongjie Li

For an indeterminate moment problem we denote the orthonormal polynomials by P_n. We study the relation between the growth of the function P(z)=(\sum_{n=0}^\infty|P_n(z)|^2)^{1/2} and summability properties of the sequence (P_n(z)). Under…

Classical Analysis and ODEs · Mathematics 2017-01-30 Christian Berg , Ryszard Szwarc

A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…

Combinatorics · Mathematics 2015-09-10 Alejandro Erickson , Abraham Isgur , Bradley W. Jackson , Frank Ruskey , Stephen M. Tanny

We study the growth behaviour of rational linear recurrence sequences. We show that for low-order sequences, divergence is decidable in polynomial time. We also exhibit a polynomial-time algorithm which takes as input a divergent rational…

Computational Complexity · Computer Science 2021-11-22 Shaull Almagor , Brynmor Chapman , Mehran Hosseini , Joël Ouaknine , James Worrell

Let $G$ be a finite abeilian group. A sequence $S$ with terms from $G$ is zero-sum if the sum of terms in $S$ equals zero. It is a minimal zero-sum sequence if no proper, nontrivial subsequence is zero-sum. The maximal length of a minimal…

Number Theory · Mathematics 2008-01-25 Weidong Gao , Alfred Geroldinger , David J. Grynkiewicz

We study the existence of periodic solutions of the non--autonomous periodic Lyness' recurrence u_{n+2}=(a_n+u_{n+1})/u_n, where {a_n} is a cycle with positive values a,b and with positive initial conditions. It is known that for a=b=1 all…

Dynamical Systems · Mathematics 2013-07-26 Guy Bastien , Victor Mañosa , Marc Rogalski

Zeckendorf's theorem states that every positive integer can be written uniquely as the sum of non-consecutive shifted Fibonacci numbers $\{F_n\}$, where we take $F_1=1$ and $F_2=2$. This has been generalized for any Positive Linear…

Number Theory · Mathematics 2021-08-05 Thomas C. Martinez , Steven J. Miller , Clayton Mizgerd , Jack Murphy , Chenyang Sun

We present two tools, which could be useful in determining whether or not a non-Homogenous Linear Recurrence can reach a desired rational. First, we derive the determinant that is equal to the ith term in a non-Homogenous Linear Recurrence.…

Discrete Mathematics · Computer Science 2012-01-04 Deepak Ponvel Chermakani