Kneading determinants of infinite order linear recurrences
classification
🧮 math.RA
math.DS
keywords
linearorderinfiniterecurrenceskneadingconceptsdeterminantsmatrix
read the original abstract
Infinite order linear recurrences are studied via kneading matrices and kneading determinants. The concepts of kneading matrix and kneading determinant of an infinite order linear recurrence, introduced in this work, are defined in a purely linear algebraic context. These concepts extend the classical notions of Frobenius companion matrix to infinite order linear recurrences and to the associated discriminant of finite order linear recurrences. Asymptotic Binet formulas are deduced for general classes of infinite order linear recurrences as a consequence of the analytical properties of the generating functions obtained for the solutions of these infinite order linear recurrences.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.