270

Date | 2022-11-04 |
---|---|

Speaker | 이슬비 |

Dept. | IBS-CGP |

Room | 27-325 |

Time | 16:00-17:00 |

In the study of Diophantine approximation, a natural question is which rationals p/q minimize |qx-p| with a bounded condition over q. We call such rationals the best approximations. The regular continued fraction gives an algorithm generating the best approximations. From a general perspective, we are interested in the best approximations with congruence conditions on their numerators and denominators. It is known that the continued fraction allowing only even integer partial quotients generates the best approximations whose numerator and denominator have different parity. In this talk, we explain the connection between the best approximations and the Ford circles. Then we explain how we can induce continued fraction algorithms that give the best approximating rationals with congruence conditions of modulo 2. This is joint work with Dong Han Kim and Lingmin Liao.

TEL 02-880-5857,6530,6531 / FAX 02-887-4694