Combinatorics Seminar

Let A be a random n×n matrix with independent entries, and suppose that the entries are "uniformly anticoncentrated" (for example, A could be a uniformly random n×n matrix with ±1 entries). We prove that the permanent of A is exponentially anticoncentrated, significantly improving previous bounds of Tao and Vu. Our proof also works for the determinant, giving an alternative proof of a classical theorem of Kahn, Komlós and Szemerédi. Joint work with Zach Hunter and Lisa Sauermann.