Difference between revisions of "Matroids seminar/ideas"

From UW-Math Wiki
Jump to: navigation, search
 
Line 8: Line 8:
 
* 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
 
* 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
** The self-contained proof of Mason’s conjecture. This one is very short. https://arxiv.org/abs/1811.01600
+
** 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 14: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.