Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers Minbowski's Theorem on Diophantine Approximation, focusing on symmetric, convex bounded sets and their properties. The theorem is applied to general lattices, discussing the shortest vector problem and Gram-Schmidt orthogonalization.