Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Hamiltonian dynamics on convex polytopes
Graph Chatbot
Related lectures (28)
Previous
Page 2 of 3
Next
Optimal Transport: Theory and Applications
Explores Lagrange multipliers, minimax theorems, and convex subsets in optimal transport theory.
Fundamental Groups
Explores fundamental groups, homotopy classes, and coverings in connected manifolds.
Optimal Transport: Convexity and Inequalities
Explores optimal transport, emphasizing convexity properties and inequalities in compact sets.
Sparsest Cut: Bourgain's Theorem
Explores Bourgain's theorem on sparsest cut in graphs, emphasizing semimetrics and cut optimization.
Harmonic Forms: Main Theorem
Explores harmonic forms on Riemann surfaces and the uniqueness of solutions to harmonic equations.
Minkowski-Weyl: Convexity and Separation Theorem
Explores convex sets, Minkowski-Weyl theorem, and Separation theorem in convex analysis.
Closest Vector Problem: Voronoi Cells
Explores the Closest Vector Problem and Voronoi cells in lattice reduction algorithms.
Fields Deriving from a Potential
Explores fields deriving from a potential, emphasizing integral and linear aspects.
Zig Zag Lemma
Covers the Zig Zag Lemma and the long exact sequence of relative homology.
Optimal Transport: Gradient Flows in Rd
Explores optimal transport and gradient flows in Rd, emphasizing convergence and the role of Lipschitz and Picard-Lindelöf theorems.