University of Cambridge > Talks.cam > Combinatorics Seminar > The singularity probability of a random symmetric matrix is exponentially small

The singularity probability of a random symmetric matrix is exponentially small

Add to your list(s) Download to your calendar using vCal

  • UserMarcelo Campos (IMPA, Brazil)
  • ClockThursday 05 May 2022, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact HoD Secretary, DPMMS.

Let A be drawn uniformly at random from the set of all n by n symmetric matrices with entries in −1,1. I’ll describe some recent work where we show that the probability that A is singular is at most e^(-cn), for some absolute constant c>0.

Joint work with Matthew Jenssen, Marcus Michelen and Julian Sahasrabudhe.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2022 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity