Optimal transportation for the determinant
Abstract
Among 3-valued triples of random vectors (X,Y,Z) having fixed marginal probability laws, what is the best way to jointly draw (X,Y,Z) in such a way that the simplex generated by (X,Y,Z) has maximal average volume? Motivated by this simple question, we study optimal transportation problems with several marginals when the objective function is the determinant or its absolute value.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.