On effective variations of Kronecker's approximation theorem

02/16/2016 - 12:15pm
02/16/2016 - 1:10pm
Lenny Fukshansky (CMC)

The simplest version of the famous Kronecker's approximation theorem states that for a real number x the sequence of fractional parts of nx as n runs through natural numbers is dense in the interval [0,1) if and only if x is irrational. In this talk, I will discuss some generalizations and effective versions of this classical result.

Millikan 2099, Pomona College

Claremont Graduate University | Claremont McKenna | Harvey Mudd | Pitzer | Pomona | Scripps
Proudly Serving Math Community at the Claremont Colleges Since 2007
Copyright © 2018 Claremont Center for the Mathematical Sciences