![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
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 smallAdd to your list(s) Download to your calendar using vCal
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 lists10 Things You Can Do Today to Improve Your Life Butterfly Genetics Group Lab Meeting CCIMI Short Course: Mathematics of Data - From Theory to ComputationOther talksCan 'Good' be Bad and 'Bad' be Good? (On Line) Subglacial Soft Matter Cortical (beta) dynamics of movement control Introduction |