Dynamics Lunch: Ofir David (Huji) "On Minkowski's conjecture"

Tue, 01/05/201812:00-13:00
Manchester lounge
One of the first algorithm any mathematician learns about is the Euclidean division algorithm for the rational integer ring Z. When asking whether other integer rings have similar such division algorithms, we are then led naturally to a geometric interpretation of this algorithm which concerns lattices and their (multiplicative) covering radius. In particular, we look for a uniform upper bound for the covering radius, and the most well known conjecture regarding this bound is Minkowski's conjecture. 

In this talk, we shall see this connection between the Euclidean division algorithm and Minkowski's conjecture, and we will go over the main ideas and tools that are used to try to solve this conjecture (and actually solve it in low dimensions).