Displaying 21 – 40 of 111

Showing per page

Automatic continued fractions are transcendental or quadratic

Yann Bugeaud (2013)

Annales scientifiques de l'École Normale Supérieure

We establish new combinatorial transcendence criteria for continued fraction expansions. Let  α = [ 0 ; a 1 , a 2 , ... ] be an algebraic number of degree at least three. One of our criteria implies that the sequence of partial quotients ( a ) 1 of  α is not ‘too simple’ (in a suitable sense) and cannot be generated by a finite automaton.

Best simultaneous diophantine approximations of some cubic algebraic numbers

Nicolas Chevallier (2002)

Journal de théorie des nombres de Bordeaux

Let α be a real algebraic number of degree 3 over whose conjugates are not real. There exists an unit ζ of the ring of integer of K = ( α ) for which it is possible to describe the set of all best approximation vectors of θ = ( ζ , ζ 2 ) .’

Correct rounding of algebraic functions

Nicolas Brisebarre, Jean-Michel Muller (2007)

RAIRO - Theoretical Informatics and Applications

We explicit the link between the computer arithmetic problem of providing correctly rounded algebraic functions and some diophantine approximation issues. This allows to get bounds on the accuracy with which intermediate calculations must be performed to correctly round these functions.

Diophantine approximation with partial sums of power series

Bruce C. Berndt, Sun Kim, M. Tip Phaovibul, Alexandru Zaharescu (2013)

Acta Arithmetica

We study the question: How often do partial sums of power series of functions coalesce with convergents of the (simple) continued fractions of the functions? Our theorems quantitatively demonstrate that the answer is: not very often. We conjecture that in most cases there are only a finite number of partial sums coinciding with convergents. In many of these cases, we offer exact numbers in our conjectures.

Currently displaying 21 – 40 of 111