12 problems
Let denote the entropy of the random geometric graph distribution at parameter , and let be the corresponding edge-probability parameter at w…
Let with , and let be the least number of entry-flips needed to produce from a matrix whose rank is strictly less th…
Let be chosen so that the spherical threshold connection…
PIIDG orthogonality conjecture. Then
Let be an orthogonal matrix and let be an block of . Let be a PIIDG vector, meaning a partially independent…
Grammians conjecture. There exists a constant and an increasing function , both depending only on , such that …
Let be a cycle of length with its signed cycle statistic , and let denote the noisy high-dimensional random geometric graph model witho…
Let and be fixed, let denote the noisy high-dimensional random geometric graph model without edge subsampling, and let be the signed -c…
Let denote the intensity parameter and let tend to infinity. The Gaussian and Poisson limit theorems above require growth conditions on because of dimension-dependent f…
Zero-breaking record fraction conjecture. There exist constants such that, almost surely,
Consider sufficiently spread-out oriented percolation in dimension , with spread parameter sufficiently large, and let denote the set of vertices connecte…
Let be a measurable subset with . For a subspace of dimension , let…