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
Joint Equidistribution of CM Points
Graph Chatbot
Related lectures (31)
Open Mapping Theorem
Explains the Open Mapping Theorem for holomorphic maps between Riemann surfaces.
Distribution & Interpolation Spaces
Covers the concept of distributions with compact support and their interpolation spaces.
Jordan Curve Theorem
Covers the proof of the Jordan Curve Theorem and the properties of embedded spheres.
Lipschitz Maps and Compact Domains
Covers Lipschitz maps, compact domains, changing variables, counting problems, and probability of ideals.
Hadamard Factorisation
Covers the Hadamard factorisation theorem for entire functions of order at most 1.
Approximation by Smooth Functions
Discusses approximation by smooth functions and the convergence of function sequences in normed vector spaces.
Central Limit Theorem
Covers the Central Limit Theorem and its application to random variables, proving convergence to a normal distribution.
Optimal Transport: Stability and Counterexamples
Covers stability in optimal transport and provides examples of discontinuous optimal solutions.
Equidistribution of CM Points
Explores the equidistribution of CM points and the implications of ergodicity in measure-preserving systems.
Sparsest Cut: Bourgain's Theorem
Explores Bourgain's theorem on sparsest cut in graphs, emphasizing semimetrics and cut optimization.
Sparsest Cut: ARV Theorem
Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
Previous
Page 2 of 2
Next