for some c > 0, a major breakthrough! Further, their methods are sufficiently robust to yield analogous bounds not only on permanents of random matrices with independent entries…
Statement
for some c > 0, a major breakthrough! Further, their methods are sufficiently robust to yield analogous bounds not only on permanents of random matrices with independent entries but can also to recover the known estimates on the anti- concentration properties of the determinant. The only assumption that is required on the distribution Q of the entires of the random matrix is the very mild anti- concentration bound supx\inR Q(x) \leq p for some fixed p < 1. The second highlight of the workshop was the joint work of Richard Montgomery and Lisa Sauermann establishing an asymptotic form of Rota’s Basis Conjecture. This attractive conjecture, posed by Rota in 1989, states that any family of n bases in a matroid of rank n can be rearranged into a family n bases that is transverse The report passage is retained verbatim as the relevant context for this extracted problem.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.