On the multiplicity of linear recurrence sequences
From MaRDI portal
Publication:2466033
The author proves a lemma regarding the linear independence of certain vectors and shows that his result is close to be best possible. A consequence of this lemma is that Schmidt's upper estimate for \(\nu({\mathcal Z})\) [a certain measure of the set of zeros of a linear recursive sequence of complex numbers of order \(t\)] which was \(\,\nu({\mathcal Z}) < \exp \exp \exp (20t)\,\) is improved into \(\,\nu({\mathcal Z}) < \exp \exp \exp ( {\sqrt{11t}\,\log t})\).
Recommendations
Cites work
Cited in
(13)- The zero multiplicity of linear recurrence sequences
- On the growth of multi-recurrences
- On the nonlinearity of linear recurrence sequences
- On prime factors of terms of linear recurrence sequences
- Linear recurrences in the degree sequences of monomial mappings
- scientific article; zbMATH DE number 1187248 (Why is no real title available?)
- scientific article; zbMATH DE number 1022818 (Why is no real title available?)
- Quantitative versions of the subspace theorem and applications
- On the gcd's of \(k\) consecutive terms of Lucas sequences
- scientific article; zbMATH DE number 7598168 (Why is no real title available?)
- Linear recurrence sequences and the duality defect conjecture
- On the intersection of infinite geometric and arithmetic progressions
- Maximal multiplicities in cocharacter sequences.
This page was built for publication: On the multiplicity of linear recurrence sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2466033)