An upper bound for the G.C.D. of an - 1 and bn -1
By Yann Bugeaud, Pietro Corvaja, Umberto Zannier. 2003
108 citations recorded by the source corpus.
Subfields: Algebra and Number Theory, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/b92ef47814ae99af234a851ad7e469bffe8b5458
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
- Joseph H. Silverman
- Umberto Zannier
- Pietro Corvaja
- Jonathan Pila
- Aaron Levin
- Franccois Berteloot
- P. Habegger
- D. Masser
In Electrical and Electronic Engineering
Citations in the corpus
- A Lower Bound for the Height of a Rational Function at S-unit Points (2003, methodology): “bound X µ∈MK log− max{|u−1|µ,|v−1|µ} >−ǫ· max{h(u),h(v)}, (1.3) valid for all ǫand all multiplicatively independent pairs (u,v) ∈ Γ apart a finite set depending on ǫand Γ. Also, the main results of [1] and [6] are immediate consequences of this Corollary. Our most general result is the following M”
- Generalized Greatest Common Divisors, Divisibility Sequences, and Vojta’s Conjecture for Blowups (2004, methodology): “raic groups, and we apply Vojta’s conjecture to obtain a strong bound on the divisibility sequences attached to abelian varieties of dimension at least two. Introduction Bugeaud, Corvaja, and Zannier [2] recently proved that if a and b are multiplicatively independent integers, then for every ǫ >”