An estimate for the multiplicity of binary recurrences

DOI10.1016/S0764-4442(97)83543-4MaRDI QIDQ4385788zbMATH OpenOpenAlexFDO

Authors Roberto Ferretti

Publication date 2 November 1998

Published in Comptes Rendus de l'Académie des Sciences - Series I - Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9708214

zbMATH Keywords

binary recurrence relationcomplex sequencesFaltings' product theoremquantitative parametric Roth's theoremrecurrence sequencesRoth's lemmasubspace theorem

Mathematics Subject Classification ID

Recurrences (11B37) Exponential Diophantine equations (11D61)

Abstract: In this paper we improve drastically the estimate for the multiplicity of a binary recurrence. The main contribution comes from an effective version of the Faltings' Product Theorem.

Recommendations

• scientific article; zbMATH DE number 3855211
• The multiplicity of binary recurrences
• Multiplicities of binary recurrences

Cited in

(3)

• Multiplicative relations on binary recurrences
• scientific article; zbMATH DE number 1817717 (Why is no real title available?)
• scientific article; zbMATH DE number 5224681 (Why is no real title available?)

This page was built for publication: An estimate for the multiplicity of binary recurrences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385788)