Lectures in course MATH-513: Metric embeddings

Covers open balls, lemma statements, and proof techniques in embedding into l_inf.

Covers the Fréchet embedding with distortion D and its applications.

Introduces Bourgain's Theorem and a lemma related to subsets.

Covers the proof of the main lemma and its mathematical properties.

Explores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.

Explores convex relaxation and negative type theorems in convex programs.

Covers embedding graphs into trees with a focus on minimizing distortion and Bartal Tree embeddings.