Matroids seminar/ideas: Difference between revisions
Jump to navigation
Jump to search
(Created page with "Looking to come talk at matroids seminar? Don't know what to talk about? Look no further! This page houses the world's finest selection of matroid-related talk ideas that we'd...") |
No edit summary |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
* Matroids in combinatorial optimization | * Matroids in combinatorial optimization | ||
* Matroids in information theory | * Matroids in information theory | ||
* The same set of authors wrote a series of three papers called “Log-Concave Polynomials I, II, & III” | * The same set of authors wrote a series of three papers called “Log-Concave Polynomials I, II, & III”: they develop basis counting algorithms & prove the strongest version of Mason's conjecture | ||
** LCP I: “First nontrivial deterministic basis-counting algorithm for general matroids” https://arxiv.org/abs/1807.00929 | ** LCP I: “First nontrivial deterministic basis-counting algorithm for general matroids” https://arxiv.org/abs/1807.00929 | ||
** Randomized algorithm for basis-counting. They also prove a 30-year-old conjecture about the exchange graph of the bases https://arxiv.org/abs/1811.01816 | ** LCP II: Randomized algorithm for basis-counting. They also prove a 30-year-old conjecture about the exchange graph of the bases https://arxiv.org/abs/1811.01816 | ||
** LCP III: The self-contained proof of Mason’s conjecture. This one is very short. https://arxiv.org/abs/1811.01600 | |||
Latest revision as of 20:17, 16 February 2019
Looking to come talk at matroids seminar? Don't know what to talk about? Look no further! This page houses the world's finest selection of matroid-related talk ideas that we'd like to hear. Feel free to pile on your own ideas.
- Kashyap, Navin; Soljanin, Emina; Vontobel, Pascal Applications of Matroid Theory & Combinatorial Optimization to Information and Coding theory
- Matroids in coding theory
- Matroids in combinatorial optimization
- Matroids in information theory
- The same set of authors wrote a series of three papers called “Log-Concave Polynomials I, II, & III”: they develop basis counting algorithms & prove the strongest version of Mason's conjecture
- LCP I: “First nontrivial deterministic basis-counting algorithm for general matroids” https://arxiv.org/abs/1807.00929
- LCP II: Randomized algorithm for basis-counting. They also prove a 30-year-old conjecture about the exchange graph of the bases https://arxiv.org/abs/1811.01816
- LCP III: The self-contained proof of Mason’s conjecture. This one is very short. https://arxiv.org/abs/1811.01600