- Series
- Lorentzian Polynomials Seminar
- Time
- Tuesday, October 8, 2019 - 2:50pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Mohit Singh – Georgia Tech – mohit.singh@isye.gatech.edu – https://www2.isye.gatech.edu/~msingh94/
- Organizer
- Trevor Gunn
We will discuss a deterministic, polynomial (in the rank) time approximation algorithm for counting the bases of a given matroid and for counting common bases between two matroids of the same rank. This talk follows the paper (https://arxiv.org/abs/1807.00929) of Nima Anari, Shayan Oveis Gharan, and Cynthia Vinzant.