Jonathan Leake


Email: jonathan at jleake dot com
Location: Technische Universität Berlin, Germany
Physical location (COVID): Leake Family Residence, Mathematics Division, Katy, TX



My research interests lie mainly in polynomials and combinatorics; especially analytic questions concerning linear operators and zeros of polynomials, discrete approximation, and applications to computer science.



  1. A Polynomial-Time Algorithm and Applications for Matrix Sampling from Harish-Chandra--Itzykson-Zuber Densities (with C. McSwiggen and N. Vishnoi), 2020. [arXiv]
  2. On the Computability of Continuous Maximum Entropy Distributions: Adjoint Orbits of Lie Groups (with N. Vishnoi), 2020. [arXiv]
  3. Lower Bounds for Contingency Tables via Lorentzian Polynomials (with P. Brändén and I. Pak), 2020. [arXiv]
  4. Capacity Lower Bounds via Productization (with L. Gurvits), 2020. [arXiv]
  5. On the Further Structure of the Finite Free Convolutions (with N. Ryder), 2018. [arXiv]
  6. A Representation Theoretic Interpretation of the Borcea-Brändén Characterization, 2017. [arXiv]


  1. Connecting the q-Multiplicative Convolution and the Finite Difference Convolution (with N. Ryder), Advances in Mathematics (2020). [journal, arXiv]
  2. On the Computability of Continuous Maximum Entropy Distributions with Applications (with N. Vishnoi), STOC (2020). [conference, arXiv]
  3. Counting Matchings via Capacity Preserving Operators (with L. Gurvits), accepted by Combinatorics, Probability, and Computing (2020). [arXiv]
  4. Mixed Determinants and the Kadison-Singer Problem (with M. Ravichandran), Mathematische Annalen (2020). [journal, arXiv]
  5. Generalizations of the Matching Polynomial to the Multivariate Independence Polynomial (with N. Ryder), Algebraic Combinatorics (2019). [journal, arXiv]

Invited Talks

Fellowships and Positions