Displaying 121 – 140 of 239

Showing per page

Algebraic independence over p

Peter Bundschuh, Kumiko Nishioka (2004)

Journal de Théorie des Nombres de Bordeaux

Let f ( x ) be a power series n 1 ζ ( n ) x e ( n ) , where ( e ( n ) ) is a strictly increasing linear recurrence sequence of non-negative integers, and ( ζ ( n ) ) a sequence of roots of unity in ¯ p satisfying an appropriate technical condition. Then we are mainly interested in characterizing the algebraic independence over p of the elements f ( α 1 ) , ... , f ( ...

Algebraic leaves of algebraic foliations over number fields

Jean-Benoît Bost (2001)

Publications Mathématiques de l'IHÉS

We prove an algebraicity criterion for leaves of algebraic foliations defined over number fields. Namely, consider a number field K embedded in C , a smooth algebraic variety X over K , equipped with a K - rational point P , and F an algebraic subbundle of the its tangent bundle T X , defined over K . Assume moreover that the vector bundle F is involutive, i.e., closed under Lie bracket. Then it defines an holomorphic foliation of the analytic manifold X ( C ) , and one may consider its leaf F through P . We prove...

All Liouville Numbers are Transcendental

Artur Korniłowicz, Adam Naumowicz, Adam Grabowski (2017)

Formalized Mathematics

In this Mizar article, we complete the formalization of one of the items from Abad and Abad’s challenge list of “Top 100 Theorems” about Liouville numbers and the existence of transcendental numbers. It is item #18 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/. Liouville numbers were introduced by Joseph Liouville in 1844 [15] as an example of an object which can be approximated “quite closely” by a sequence of rational numbers. A real...

Almost powers in the Lucas sequence

Yann Bugeaud, Florian Luca, Maurice Mignotte, Samir Siksek (2008)

Journal de Théorie des Nombres de Bordeaux

The famous problem of determining all perfect powers in the Fibonacci sequence ( F n ) n 0 and in the Lucas sequence ( L n ) n 0 has recently been resolved [10]. The proofs of those results combine modular techniques from Wiles’ proof of Fermat’s Last Theorem with classical techniques from Baker’s theory and Diophantine approximation. In this paper, we solve the Diophantine equations L n = q a y p , with a > 0 and p 2 , for all primes q < 1087 and indeed for all but 13 primes q < 10 6 . Here the strategy of [10] is not sufficient due to the sizes of...

Almost-sure growth rate of generalized random Fibonacci sequences

Élise Janvresse, Benoît Rittaud, Thierry de la Rue (2010)

Annales de l'I.H.P. Probabilités et statistiques

We study the generalized random Fibonacci sequences defined by their first non-negative terms and for n≥1, Fn+2=λFn+1±Fn (linear case) and ̃Fn+2=|λ̃Fn+1±̃Fn| (non-linear case), where each ± sign is independent and either + with probability p or − with probability 1−p (0<p≤1). Our main result is that, when λ is of the form λk=2cos(π/k) for some integer k≥3, the exponential growth of Fn for 0<p≤1, and of ̃Fn for 1/k<p≤1, is almost surely positive and given by ∫0∞log x dνk, ρ(x),...

Currently displaying 121 – 140 of 239