Abstract:Abstract. Let K be an algebraic number field of degree d 3, σ 1 , σ 2 , . . . , σ d the embeddings of K into C, α a non-zero element in K , a 0 ∈ Z, a 0 > 0 andLet υ be a unit in K . For a ∈ Z, we twist the binary formGiven m > 0, our main result is an effective upper bound for the size of solutions (x, y, a) ∈ Z 3 of the Diophantine inequalitiesfor which x y = 0 and Q(αυ a ) = K . Our estimate is explicit in terms of its dependence on m, the regulator of K and the heights of F 0 and of υ; it also involves an … Show more
“…Therefore, let us suppose max{n, a} sufficiently large, so we are free to use the notation O of Section 4. Our paper [6] takes care of the case where n is bounded by an absolute constant. This allows us to suppose n ≥ 1.…”
Section: Estimates For |X − λ Amentioning
confidence: 99%
“…(iv) For n ≥ 0 with a ≥ 1, we have v a > 2v a−1 except for (n, a) = (0, 1) where (v 1 , v 0 ) = (2, 3) and for (n, a) = (0, 3) where (v 3 , v 2 ) = (11,6) and for (n, a) = (1, 1) where (v 1 , v 0 ) = (3,3).…”
Section: Some Numerical Calculationsmentioning
confidence: 99%
“…(v) For n = 0 with a ≥ 1, we have 0 < (−1) a u a ≤ 1 2 v a , except for a = 2 where (u 2 , v 2 ) = (5,6).…”
Section: Some Numerical Calculationsmentioning
confidence: 99%
“…In this paper, we deal with equations related to infinite families of cyclic cubic fields. In a forthcoming paper [6], we go one step further by considering twists by a power of a totally real unit.…”
A family of Thue equations involving powers of units of the simplest cubic fields par Claude Levesque et Michel WaldschmidtRésumé. E. Thomas fut l'un des premiers à résoudre une famille infinie d'équations de Thue, lorsqu'il a considéré les formesCette famille est associée à la famille des corps cubiques les plus simples Q(λ) de D. Shanks, λ étant une racine de F n (X, 1). Nous introduisons dans cette famille un second paramètre en remplaçant les racines du polynôme minimal F n (X, 1) de λ par les puissances a-ièmes des racines et nous résolvons de façon effective la famille d'équations de Thue que nous obtenons et qui dépend maintenant des deux paramètres n et a.
“…Therefore, let us suppose max{n, a} sufficiently large, so we are free to use the notation O of Section 4. Our paper [6] takes care of the case where n is bounded by an absolute constant. This allows us to suppose n ≥ 1.…”
Section: Estimates For |X − λ Amentioning
confidence: 99%
“…(iv) For n ≥ 0 with a ≥ 1, we have v a > 2v a−1 except for (n, a) = (0, 1) where (v 1 , v 0 ) = (2, 3) and for (n, a) = (0, 3) where (v 3 , v 2 ) = (11,6) and for (n, a) = (1, 1) where (v 1 , v 0 ) = (3,3).…”
Section: Some Numerical Calculationsmentioning
confidence: 99%
“…(v) For n = 0 with a ≥ 1, we have 0 < (−1) a u a ≤ 1 2 v a , except for a = 2 where (u 2 , v 2 ) = (5,6).…”
Section: Some Numerical Calculationsmentioning
confidence: 99%
“…In this paper, we deal with equations related to infinite families of cyclic cubic fields. In a forthcoming paper [6], we go one step further by considering twists by a power of a totally real unit.…”
A family of Thue equations involving powers of units of the simplest cubic fields par Claude Levesque et Michel WaldschmidtRésumé. E. Thomas fut l'un des premiers à résoudre une famille infinie d'équations de Thue, lorsqu'il a considéré les formesCette famille est associée à la famille des corps cubiques les plus simples Q(λ) de D. Shanks, λ étant une racine de F n (X, 1). Nous introduisons dans cette famille un second paramètre en remplaçant les racines du polynôme minimal F n (X, 1) de λ par les puissances a-ièmes des racines et nous résolvons de façon effective la famille d'équations de Thue que nous obtenons et qui dépend maintenant des deux paramètres n et a.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.