Multiplicities of binary recurrences
From MaRDI portal
Let \(K\) be an algebraic number field of degree \(d\) and \(u_0\), \(u_1\) algebraic integers in \(K\), and \(\omega\in K^*\). Consider a nondegenerate binary recurrence \((u_n)_{n\geq 0}\) with companion polynomial \(f(X)=(X-\lambda)(X-\mu)\). Then, the authors prove: Theorem. If \(\min\{|\lambda|, |\mu|\}>1\) and \(\max\{\text{H}(u_0), \text{H}(u_1)\}>c(d,f,\omega)\), where \(c(d,f,\omega)\) is an effectively computable constant, then the equation \(u_n=\omega\) has at most one solution. The main tool for the proof is linear forms in logarithms.
Recommendations
Cited in
(14)- Divisibility properties of binary recurrent sequences
- On binary recurrence sequences
- Multiplicative relations on binary recurrences
- Two-periodic ternary recurrences and their Binet-formula
- scientific article; zbMATH DE number 3849342 (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?)
- The Mathematical Work of Wolfgang Schmidt
- scientific article; zbMATH DE number 1236695 (Why is no real title available?)
- An estimate for the multiplicity of binary recurrences
- On the gcd's of \(k\) consecutive terms of Lucas sequences
- How can the product of two binary recurrences be constant?
- scientific article; zbMATH DE number 2097493 (Why is no real title available?)
- Repetitions of multinomial coefficients and a generalization of Singmaster's conjecture
This page was built for publication: Multiplicities of binary recurrences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2739247)
