The multiplicity of binary recurrences
Let \((u_m)_{m \in\mathbb{Z}}\) be a complex linear recurrence sequence. For any complex number \(c\) one defines \(U(c)\) to be the number of indices \(m\in \mathbb{Z}\) for which \(u_m =c\). The multiplicity of the recurrence sequence is defined to be \(U= \sup_c U(c)\). The sequence is called degenerate if its companion polynomial has at least a pair of distinct roots whose ratio is a root of unity; otherwise, it is called non-degenerate. A longstanding conjecture is that an arbitrary complex non-degenerate recurrence sequence of order \(n\geq 2\) has multiplicity bounded by a function that depends only on \(n\). In the paper under review, the author proves the conjecture for \(n=2\) by showing that, in this case, \(U\leq 2^{2^{23}}\). In his proof he has to make one further very natural assumption; namely, that at least one root of the second degree companion polynomial is not a root of unity. For ternary sequences he proves that \(U(0)\leq 2^{2^{23}}\). Two basic tools of the proof are a quantitative sharpened version of the subspace theorem in dimension 2 and a result by the author and \textit{E. Wirsing}, which gives universal lower bounds for the height of solutions in algebraic numbers of linear equations \(ax+by +1=0\) with complex coefficients [Lower bounds for the heights of solutions of linear equations, Invent. Math. 129, 1-10 (1997; Zbl 0883.11013)].
- scientific article; zbMATH DE number 2210126
- Two equations for linear recurrence sequences
- scientific article; zbMATH DE number 1422909
- Zeros of linear recurrence sequences
- scientific article; zbMATH DE number 2201107
- The zero multiplicity of linear recurrence sequences
- Effective results on the Skolem problem for linear recurrence sequences
- The number of solutions of linear equations in roots of unity
- On the zeros of linear recurrence sequences
- On the representation of natural numbers by sums of algebraic numbers
- The multiplicity for a class of second order recurrences
- Multiplicities of recurrence sequences
- On the multiplicity of linear recurrence sequences
- Multiplicities of binary recurrences
- Two-periodic ternary recurrences and their Binet-formula
- scientific article; zbMATH DE number 1817717 (Why is no real title available?)
- scientific article; zbMATH DE number 4181428 (Why is no real title available?)
- scientific article; zbMATH DE number 3855211 (Why is no real title available?)
- scientific article; zbMATH DE number 3877267 (Why is no real title available?)
- An estimate for the multiplicity of binary recurrences
- On the Diophantine equation ๐บ_{๐}(๐ฅ)=๐บ_{๐}(๐(๐ฅ)): Higher-order recurrences
- Power multiples in binary recurrence sequences: an approach by congruences
- On a variant of Pillaiโs problem with binary recurrences and S-units
- On the intersection of infinite geometric and arithmetic progressions
- Effective bounds for the zeros of linear recurrences in function fields
This page was built for publication: The multiplicity of binary recurrences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360895)
