Lectures related to 6-polytope

Explores Hamiltonian dynamics on convex polytopes, covering symplectic capacities, EHZ capacity, and systolic ratio maximizers.

Covers linear inequalities, active constraints, and equivalent linear programs.

Explores the closest vector problem in lattices and the role of Voronoi cells in determining the closest vector.

Explores the geometric explanation of why Lasso solutions are sparse and how coefficients change with the regularization parameter.

Explores the Closest Vector Problem and Voronoi cells in lattice reduction algorithms.

Covers the fundamentals of integer programming and network flows in directed graphs.