12:30 pm Tuesday, February 1, 2005
GADGET: To Be Announced by Bob Williams (UT Austin) in RLM 9.166
Generalizations of the continued fraction algorithm, to simultaneously approximate 2 (or more) numbers were given by Euler 1849, Jacobi 1868, elaborated by Perron 1907 later by many others. Others including Lagarius have tried to make a more systematic study of such algorithms, especially almost everywhere convergence results. Closer to our work is the paper of Brentjes, 'A two-dimensional continued fraction algorithm', Crelle, 1981. With a geometric algorithm, Brentjes finds all the 'best approximants' in a lattice to a line in the positive part of $R^3,$ via Euclidian geometry of their projections onto a plane. Our approach overlaps with Brentjes, and was motivated by the Theorem: given a "Pisot" matrix there is a integral matrix with determinant $\pm 1$ such that $B^&ob;-1&cb;AB$ has all entries Here "Pisot" means the entries are integral, $detA=1,$ one eigen value is $\ge 0,$ and the other 2 are inside the unit circle. Submitted by
|
|