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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

The singularity probability of a random symmetric matrix is exponentially small

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge Café Scientifique Robinson Auditorium, Grange Road, Cambridge, CB3 9AN Live Zoom webinar, followed by Q&A session

Other talks

Using A Function-Centric Lens to Re-consider Regularisation, Representation Transfer and Geometric Properties of Neural Networks Morning Tea and Coffee RNA-Mediated Regulation of Germinal Centre B-Cell Fitness: a tale of two DEAD-box RNA helicases LMB Seminar - Mechanisms of mRNA packaging and export Fairy Tales Sheref Mansy, topic TBA
 

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