3 citations · 3 across the 1 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2009★ 3 cited
On the singularity probability of discrete random matrices
Jean Bourgain, Van Vu, Philip Matchett Wood
Let be an by random matrix where each entry is +1 or -1 independently with probability 1/2. Our main result implies that the probability that is singular is at…
math.CO2008★ 3 cited
Graph pegging numbers
Geir Helleloid, Madeeha Khalid, David Petrie Moulton +1
In graph pegging, we view each vertex of a graph as a hole into which a peg can be placed, with checker-like ``pegging moves'' allowed. Motivated by well-studied questions in graph…