The zero multiplicity of linear recurrence sequences
From MaRDI portal
Publication:1588913
DOI10.1007/BF02392575zbMath0974.11013MaRDI QIDQ1588913
Publication date: 6 December 2000
Published in: Acta Mathematica (Search for Journal in Brave)
Related Items
On the Diophantine equation πΊ_{π}(π₯)=πΊ_{π}(π(π₯)): Higher-order recurrences, Unnamed Item, On the quantitative subspace theorem, On arithmetic progressions in recurrences -- a new characterization of the Fibonacci sequence, On the intersection of infinite geometric and arithmetic progressions, Effective bounds for the zeros of linear recurrences in function fields, Arithmetic functions with linear recurrence sequences, Explicit test sets for iterated morphisms in free monoids and metabelian groups, A further improvement of the quantitative subspace theorem, The Riesz--Raikov--Bourgain theorem for an algebraic endomorphism of \(\mathbb R^p\), Diophantine equations with linear recurrences. An overview of some recent progress, A Skolem-Mahler-Lech theorem in positive characteristic and finite automata, On the multiplicity of linear recurrence sequences, On Prime Factors of Terms of Linear Recurrence Sequences, D0L sequence equivalence is inPfor fixed alphabets, The Mathematical Work of Wolfgang Schmidt, On the Diophantine Equation G n (x) = G m (y) with Q (x, y)=0, The Diophantine equation πΌβ^{π₯β}β―πΌ_{π}^{π₯_{π}}=π(π₯β,β¦,π₯_{π}). II
Cites Work
- Unnamed Item
- Unnamed Item
- Multiplicities of algebraic linear recurrences
- Linear equations in variables which lie in a multiplicative group
- A note on recurring series
- On a question of Lehmer and the number of irreducible factors of a polynomial
- The number of solutions of linear equations in roots of unity
- An effective lower bound for the height of algebraic numbers
- Equations in roots of unity
- Zeros of recurrence sequences
