Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Is the unconditionality assumption on the vectors unnecessary for the stated maximal submatrix norm bound?
Let G be a graph, and let F be a uniformly random forest chosen from all forests of G. For edges e,f∈ E(G), negative correlation conjecture. P(e,f∈ F)≤ P(e∈ F)P(f∈ F). This conjecture asks whether edge inclusion events are negatively…
Let v_1,dotsc,v_n∈R^2 be unit vectors, and let ε_1,dotsc,ε_n be independent random signs, each uniformly distributed in -1,1. He–Juškevičius–Narayanan–Spiro conjecture. There is a constant c>0 such that, for every odd n, P [|∑_i=1^nε_i…
Consider the random walk on triangulations of a convex polygon, driven by flips of a randomly chosen diagonal. What is the mixing time?
Let (G_n) be finite transitive graphs with |G_n|→∞ and uniformly bounded effective resistances between all vertex pairs. Prove that the largest vacant component left by simple random walk drops from order |G_n| to o(|G_n|) before time…
Let X be a finite-energy, translation-invariant percolation process on Z^2 satisfying the FKG inequality. If X percolates almost surely, must it also percolate almost surely in each half-plane?
Let p:N\to M be a smooth surjection between manifolds, and let diffusion generators A on M and B on N satisfy B(f\circ p)=(Af)\circ p for every smooth f:M\to\mathbb{R}. Determine structural and spectral relationships between A and B,…
For a random \pm1 matrix M_n, does the probability tend to 1 that no choice of signs for its diagonal entries makes it singular? Also, does M_n have at least two real eigenvalues with probability 1-o(1)?
One of the main open problems about hyperbolic surfaces of large genus is whether it is possible to find X \in Mg for arbitrarily large with first positive eigenvalue of the Laplacian \lambda1 (X) > 41 (which is asymptotically optimal).…
Conjecture for an n by n random sign matrix B-n with independent plus-or-minus-one entries: P(B-n is singular) = (1/2+o-n(1))^n, equivalently (1/2)^(n)(1+o-n(1))^n; determine the sharp singularity asymptotic.
Among the 2^n+1 polynomials P(z)=∑_k=0^n ε_kz^k with ε_k∈-1,1, do all but o(2^n) satisfy min_|z|=1|P(z)|<1? More generally, determine the typical size of this minimum.
Let A be CM abelian variety over bar mathbbQ and let c be an absolute Hodge class. Reduce A to A_0 over overline mathbbF_p and take a Lefschetz class x on A_0 of complementary dimension. Then x.bar c∈ mathbbQ_ℓ; is it in mathbbQ and…
We know how to construct points on an elliptic curve E over mathbbF_q(T) when the analytic rank is 1 by using (Drinfel'd) Heegner points. What if X is a hyperelliptic curve over mathbbF_q(T) of higher genus? Is there any way of…
For the random transposition model on the symmetric group S_n, determine the correct order in n of the optimal geodesic-convexity constant \kappa, known to satisfy 4/(n^2-n) \leq \kappa \leq 2/(n-1).
How can one define similarity metrics between stochastic processes? Optimal transport distances for Markov chains Gergely Neu (joint work with Sergio Calo, Anders Jonsson, Ludovic Schwartz, and Javier Segovia-Aguas) Overparametrization,…
Analysis of existence and properties of S-curves in the scalar case when the potential is φ(z)=Re z^p, for p≥ 3, and we take τ as the set of continua that join neighboring valleys of φ(z) (where φ(z)→-∞) in the complex plane. In…
Let (Γ,ν) be the ag-ensemble, with parameters α, γ, and D, and let X^i_n denote the relevant random variable for the ensemble. The ag-ensemble probability bound. For any α, γ, and D, there exists a constant c>0 such that ν(X^i_n>0)≤…
Let X be a transient partially exchangeable process taking values in a countable set S with non-random initial state X_0. Its transition numbers are M=(M(u,v))_u,v∈ S=(#i≥ 0:(X_i,X_i+1)=(u,v))_u,v∈ S. Diaconis–Freedman conjecture. The…
Can you compare the hitting times of the interchange process to hitting times for the SRW on a graph G.
For strongly edge-reinforced random walk with a reciprocally summable weight function, does the walk on graphs containing odd cycles, in particular a triangle, eventually visit one random edge back and forth as it does on bounded-degree…