On large zeros of linear recurrence sequences
From MaRDI portal
Cites work
- A Logic of Probability with Decidable Model Checking
- A note on recurring series
- A survey of computational complexity results in systems and control
- A universal Skolem set of positive lower density
- Ein Verfahren zur Behandlung gewisser exponentialer Gleichungen und diophantischer Gleichungen.
- Eine arithmetische Eigenschaft der Taylor-Koeffizienten rationaler Funktionen.
- Harald Cramér and the distribution of prime numbers
- scientific article; zbMATH DE number 3823893 (Why is no real title available?)
- scientific article; zbMATH DE number 572102 (Why is no real title available?)
- scientific article; zbMATH DE number 1973372 (Why is no real title available?)
- Jumping Champions
- Near-Optimal Complexity Bounds for Fragments of the Skolem Problem
- New maximal prime gaps and first occurrences
- Occurrence of zero in a linear recursive sequence
- On Skolem-hardness and saturation points in Markov decision processes
- On the decidability of reachability in linear time-invariant systems
- On the order of magnitude of the difference between consecutive prime numbers
- On the Skolem problem and the Skolem conjecture
- Polynomial-time algorithm for the orbit problem
- Skolem meets schanuel
- Structure and randomness. Pages from year one of a mathematical blog
- The Complexity of theA B CProblem
- The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
- The difference between consecutive primes. II
- The zero multiplicity of linear recurrence sequences
This page was built for publication: On large zeros of linear recurrence sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310246)
