### No seminar this week. We will resume on Nov. 26.

- Series
- Lorentzian Polynomials Seminar
- Time
- Tuesday, November 19, 2019 - 14:50 for
- Location
- Speaker

- You are here:
- GT Home
- Home
- News & Events

- Series
- Lorentzian Polynomials Seminar
- Time
- Tuesday, November 19, 2019 - 14:50 for
- Location
- Speaker

- Series
- Lorentzian Polynomials Seminar
- Time
- Tuesday, November 12, 2019 - 14:50 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Mohit Singh – Georgia Tech

I will continue to describe deterministic algorithms for approximately counting common bases of matroids within an exponential factor. This is based on AOVI and previous works of AO.

- Series
- Lorentzian Polynomials Seminar
- Time
- Tuesday, October 22, 2019 - 14:50 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Prasad Tetali – Georgia Tech

This is quick tutorial on bounding the mixing time of a finite Markov chain in terms of functional inequalities defining the spectral gap and the entropy constant of a Markov chain. The lecture will include some examples, including bounding the mixing time of the random transposition shuffle and (time permitting) that of the basis-exchange walk on a balanced matroid.

This is intended as a review lecture before Nima Anari’s lectures (during Nov. 4-6) on applications of Lorentzian polynomials, including recent breakthrough analyses of the basis-exchange walk on an arbitrary matroid.

- Series
- Lorentzian Polynomials Seminar
- Time
- Tuesday, October 8, 2019 - 14:50 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Mohit Singh – Georgia Tech – mohit.singh@isye.gatech.edu

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.

- Series
- Lorentzian Polynomials Seminar
- Time
- Tuesday, October 1, 2019 - 14:50 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Trevor Gunn – Georgia Tech

Using what we have studied in the Brändén-Huh paper, we will go over the proof of the ultra-log-concavity version of Mason's conjecture.

- Series
- Lorentzian Polynomials Seminar
- Time
- Tuesday, September 17, 2019 - 14:50 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Josephine Yu – Georgia Tech

I will discuss a proof of the statement that the support of a Lorentzian polynomial is M-convex, based on sections 3-5 of the Brändén—Huh paper.

- Series
- Lorentzian Polynomials Seminar
- Time
- Tuesday, September 10, 2019 - 14:50 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Greg Blekherman – Georgia Tech

I will show some operations that preserve Lorentzian property following Section 6 of https://arxiv.org/pdf/1902.03719.pdf

- Series
- Lorentzian Polynomials Seminar
- Time
- Tuesday, September 3, 2019 - 14:50 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Matt Baker – Georgia Tech

I will provide an introduction to Lorentzian Polynomials in the sense of https://arxiv.org/abs/1902.03719

- Offices & Departments
- News Center
- Campus Calendar
- Special Events
- GreenBuzz
- Institute Communications
- Visitor Resources
- Campus Visits
- Directions to Campus
- Visitor Parking Information
- GTvisitor Wireless Network Information
- Georgia Tech Global Learning Center
- Georgia Tech Hotel & Conference Center
- Barnes & Noble at Georgia Tech
- Ferst Center for the Arts
- Robert C. Williams Paper Museum