Decision problems for second-order holonomic sequences
We study decision problems for sequences which obey a second-order holonomic recurrence of the form f(n + 2) = P(n)f(n + 1) + Q(n)f(n) with rational polynomial coefficients, where P is non-constant, Q is non-zero, and the degree of Q is smaller than or equal to that of P. We show that existence of i...
Autores principales: | Neumann, E, Ouaknine, J, Worrell, J |
---|---|
Formato: | Conference item |
Lenguaje: | English |
Publicado: |
Schloss Dagstuhl – Leibniz Center for Informatics
2021
|
Ejemplares similares
-
On positivity and minimality for second-order holonomic sequences
por: Kenison, G, et al.
Publicado: (2021) -
On rational recursion for holonomic sequences
por: Teguia Tabuguia, B, et al.
Publicado: (2024) -
Decision Problems for Linear Recurrence Sequences.
por: Ouaknine, J, et al.
Publicado: (2012) -
Topological and holonomic quantum computation based on second-order topological superconductors
por: Song-Bo Zhang, et al.
Publicado: (2020-10-01) -
On the decidability of monadic second-order logic with arithmetic predicates
por: Berthé, V, et al.
Publicado: (2024)