George Kenison
George Kenison
Home
Publications
Posts
CV
Light
Dark
Automatic
recurrence sequences
On the Positivity Problem for second-order holonomic sequences
A sequence is holonomic if its terms obey a linear recurrence relation with polynomial coefficients. In this paper we consider the …
G. Kenison
,
O. Klurman
,
E. Lefaucheux
,
F. Luca
,
P. Moree
,
E. C. Sertöz
,
J. Ouaknine
,
M. A. Whiteland
,
J. Worrell
PDF
Cite
On the growth of hypergeometric sequences
Hypergeometric sequences obey first-order linear recurrence relations with polynomial coefficients and are commonplace throughout the …
G. Kenison
,
J. Konieczny
,
F. Luca
,
A. Scoones
,
M. Shirmohammadi
,
J. Worrell
Cite
arXiv
Positivity Problems for Reversible Linear Recurrence Sequences
It is a longstanding open problem whether there is an algorithm to decide the Positivity Problem for linear recurrence sequences (LRS) …
G. Kenison
,
J. Nieuwveld
,
J. Ouaknine
,
J. Worrell
PDF
Cite
DOI
On the Skolem Problem for Reversible Sequences
Given an integer linear recurrence sequence $\langle X_n \rangle$, the Skolem Problem asks to determine whether there is a natural …
G. Kenison
PDF
Cite
DOI
dagstuhl
On Positivity and Minimality for Second-Order Holonomic Sequences
An infinite sequence $\langle u_n \rangle$ of real numbers is holonomic if it satisfies a linear recurrence relation with polynomial …
G. Kenison
,
O. Klurman
,
E. Lefaucheux
,
F. Luca
,
P. Moree
,
J. Ouaknine
,
M. A. Whiteland
,
J. Worrell
PDF
Cite
DOI
dagstuhl
On the Skolem Problem and prime powers
The Skolem Problem asks, given a linear recurrence sequence $(u_n)$, whether there exists $n\in\mathbb{N}$ such that $u_n = 0$. In this …
G. Kenison
,
R. Lipton
,
J. Ouaknine
,
J. Worrell
PDF
Cite
DOI
arXiv
Cite
×