Introduction to the combinatorial atlas
Abstract
We give elementary self-contained proofs of the strong Mason conjecture recently proved by Anari at. al. (arXiv:1811.01600) and Br\"and\'en--Huh (arXiv:1902.03719), and of the classical Alexandrov--Fenchel inequality. Both proofs use the combinatorial atlas technology recently introduced by the authors (arXiv:2110.10740). We also give a formal relationship between combinatorial atlases and Lorentzian polynomials.
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.