On continued fraction algorithms

Leiden Repository

On continued fraction algorithms

Type: Doctoral Thesis
Title: On continued fraction algorithms
Author: Smeets, Ionica
Publisher: Mathematical Institute, Faculty of Science, Leiden University
Issue Date: 2010-06-16
Keywords: Continued fractions
Diophantine approximation
Natural extensions
Number theory
Abstract: Is there a good continued fraction approximation between every two bad ones? What is the entropy of the natural extension for alpha-Rosen fractions? How do you find multi-dimensional continued fractions with a guaranteed quality in polynomial time? These, and many more, questions are answered in this thesis.
Description: Promotor: Robert Tijdeman, Co-promotor: Cornelis Kraaikamp
With summary in Dutch
Faculty: Faculteit der Wiskunde en Natuurwetenschappen
Citation: Smeets, I., 2010, Doctoral thesis, Leiden University
Sponsor: Thomas Stieltjes Institute for Mathematics
Handle: http://hdl.handle.net/1887/15693

Files in this item

Description Size View
application/pdf Cover 2.163Mb View/Open
application/pdf Full text 7.661Mb View/Open
application/pdf Propositions 132.6Kb View/Open

This item appears in the following Collection(s)