Linear recurrence sequences without zeros
From MaRDI portal
Publication:5496703
DOI10.1007/s10587-014-0138-1zbMath1349.11017OpenAlexW1977921585MaRDI QIDQ5496703
Aivaras Novikas, Arturas Dubickas
Publication date: 27 January 2015
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10338.dmlcz/144064
linear recurrence sequenceperiod modulo \(p\)characteristic polynomial of a sequencepolynomial splitting in \(\mathbb F_p[z\)]
Related Items (3)
Periodic sequences modulo 1 and Pisot numbers ⋮ On the number of residues of linear recurrences ⋮ Recurrence with prescribed number of residues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diophantine approximations with Fibonacci numbers
- Distribution of geometric sequences modulo 1
- Maximal frequencies of elements in second-order linear recurring sequences over a finite field
- The ABC conjecture and the powerful part of terms in binary recurring sequences
- Chebotarëv and his density theorem
- On the distinctness of modular reductions of primitive sequences over \(\mathbb Z/(2^{32}-1)\)
- On the two smallest Pisot numbers
- On the distance from a rational power to the nearest integer
- An arithmetical property of powers of Salem numbers
- Irreducibility Testing and Factorization of Polynomials
- ARITHMETICAL PROPERTIES OF POWERS OF ALGEBRAIC NUMBERS
- Linear Recurring Sequences over Finite Fields.
- Chebyshev's method for number fields
This page was built for publication: Linear recurrence sequences without zeros