Matroids seminar/ideas: Difference between revisions

From UW-Math Wiki
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
Line 9: Line 9:
** 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
** 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

Revision as of 20:16, 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”. In first two, they (lightly but crucially) apply results from Hodge Theory of Combo Geo & Botong and June Huh’s paper to develop new basis counting algorithms (I think this was a problem that Jose brought up at our first meeting). In the final one provides “a self-contained proof of Mason’s strongest conjecture”, a result that strengthens the log-concavity result of Hodge Theory for Combo Geo