On continued fraction algorithms

Author(s):
Smeets, I. (0000-0003-1743-9493)
Published
2010
Publication type
Doctoral Thesis

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.

Continued fractionsDiophantine approximationNatural extensionsNumber theory
Defense date
2010-06-16
Language
English
Supervisor(s)
Tijdeman, R.
Advisor(s)
Kraaikamp, C.
Committee member(s)
Schmidt, T.A.; Bosma, W.; Lenstra, H.W.; Stevenhagen, P.
Qualification
Ph.D.
Degree granting institution
Mathematical Institute (MI), Faculty of Science, Leiden University, Leiden
hdl
1887/15693

Juridical information

Court
LEI Universiteit Leiden

Funding

Sponsorship
Thomas Stieltjes Institute for Mathematics