Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For every δ>0 there exists ε>0 such that the following holds uniformly over every finite graph G, every percolation parameter p∈[0,1], every origin vertex o∈ V(G), every boundary set ∂ G⊆ V(G), and every collection of increasing events…
Let (Ω,S,B,μ) be a tree-indexed process. Define f(n)=μ^n(π_n(B))^-1 so that f(n) is the probability that a sequence of n IID picks from μ extends to some sequence in B. The converse capacity conjecture. If P(Γ;B)>0, then…
Let ℓ(k) be the limiting probability of exactly k missing differences: ℓ(k)=lim_n→∞P_n^M(k). No-divot conjecture. The limiting probabilities satisfy ℓ(4)>ℓ(2)>ℓ(6)>ℓ(0)>ℓ(8)>ℓ(10)>ℓ(12)>…. In other words, the sequence ℓ has no divots.…
- 10 Lectures and 42 Open Problems — Stability conditions for tightness of k-median LP and k-means SDP
Can one give conditions for integrality of the k-medians LP or the k-means SDP based on stability type properties (on the fact that the data is “well-explained” by a certain number of clusters)?
Let m^(n) be a sequence of weight distributions with corresponding probability distributions (P^(n))_n ∈ N, where P^(n)=(p_i^(n))_i ∈ N is a probability distribution on N. Let m^(∞) be a weight distribution whose corresponding probability…
For the stochastic Burgers equation driven by a cylindrical Lévy process W(\beta(t)) with \beta\in Sub(p), p\in(1,2], does the theory and well-posedness result extend to the case of spatial regularity parameter \theta=0?
In defining mass-stationarity for invariant random measures, would allowing external randomization—such as an independent stationary background or transport kernels instead of only allocations—suffice to characterize Palm versions of…
For Poisson-generic reals, is there a computable example, are all Martin--Lof random reals Poisson generic, can Poisson genericity be characterized by Kolmogorov complexity, and is the class of Poisson-generic reals Pi^0_3-complete?
Let n and ell be fixed positive integers. A fair mechanism consists of a family of ell-subsets of an n-element coupon set in which every coupon appears in the same number of admissible sets, with the sampling distribution uniform on that…
Does the distribution of the e-torsion Selmer groups Sel_{p^e}(E) for elliptic curves E equal, in the limit n\to\infty, the distribution of Z\cap W for random maximal isotropic subspaces Z,W\in OGr_n(\mathbb{Z}/p^e\mathbb{Z})?
Prove that this empirical measure converges (weakly) to some probability measure. Is this measure singular with respect to the original law on the edge weights?
If G is a finitely generated group whose Følner function satisfies Føl_G(n)≤exp(n), is the Poisson boundary of its simple random walk trivial?
Let T denote the percolation time in the r-neighbour bootstrap percolation model on T_n^d, and let t=t(n) be a time parameter. Range conjecture. Theorem~ holds for all t in the range t=o(log n). The preceding results establish the theorem…
Let p_k be the orthonormal polynomials for a measure ν on R that is absolutely continuous with respect to Lebesgue measure and whose support is a compact interval. Let P_n(z) = ∑_0≤ k≤ n a_k p_k(z), with a_k iid standard (real) Gaussians.…
Bridge the gap, by demonstrating an algorithm for α_ℓ <α < α_u. Better yet, demonstrate a single algorithm which works at any density.
Let p_n denote the sequence of stopping probabilities for the random walk considered in the paper. Even-index monotonicity conjecture. p_2nleq p_2n+2 for all ngeq 2. The paper proves the corresponding inequality in the range treated by its…
For nearest-neighbor independent bond percolation on Z^d, d≥2, let p_c(d) be the critical edge-retention probability. Prove that at p=p_c(d) there is almost surely no infinite open cluster, for every d≥2.
How do twist tori TP (et L) distribute in Mg as t \to \infty? 1. Twist tori Given a pants decomposition P of a closed oriented surface S of genus g \geq 2 and a positive length vector L \in RP >0 , we consider the twist torus
Can coherent families of sets for a time-dependent stochastic dynamical system be characterized in a way that permits numerical computation, and can the resulting problem be solved efficiently in higher dimensions?
Let C_N be a cycle, let K≥3, and consider the K-type competing urn scheme with a nonzero initial configuration. For each type j, let balls of type j have independent Poisson clocks ringing at rate λ_j. Unequal-rate single-survivor…