On the multiplicity of linear recurrence sequences (Q2466033): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jnt.2006.11.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008610920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on recurring series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicities of recurrence sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zero multiplicity of linear recurrence sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2714159 / rank
 
Normal rank

Latest revision as of 15:03, 27 June 2024

scientific article
Language Label Description Also known as
English
On the multiplicity of linear recurrence sequences
scientific article

    Statements

    On the multiplicity of linear recurrence sequences (English)
    0 references
    0 references
    11 January 2008
    0 references
    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})\).
    0 references
    0 references
    linear recursive sequences
    0 references
    exponential Diophantine equations
    0 references
    0 references