Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Can one design a fast algorithm for the regularized unbalanced optimal-transport problem associated with branching Brownian motion?
For d=2, show that Ball is not a square.
Are there polynomial-time algorithms for NAE-k-SAT for large k when α ≤ α_d?
Improve the explicit upper and lower bounds for the minimum network length functions Ψ^ave(s) and Ψ^worst(s), and prove whether there is an exponent α such that each satisfies Ψ(s)asymp(s-1)^-α as sdownarrow1.
Let G=(G_n)_n≥1 be a sequence of configuration-model graphs, and let D be the independent degree distribution. Assume 0<E[D(D-2)]<∞. Define a=E[D^2]/E[D]-1, and Λ=Λ(a)=2a-1-2√a^2-a, with Λ(∞)=0. Let λ_c( G) be the critical value defined by…
Let k,i,j be nonnegative integer indices, let i denote the index tuple associated with the identity permutation id∈S_2, and write α_k,i,j=α_5,k,id,i. Staircase and stabilization conjecture. The coefficients satisfy the following…
How does μ(bf e_1) behave as a function of d?
Q: To prove the existence of an embedding Γ q,n → R ω, one uses Speicher's central limit theorem. In this procedure, is it possible to find explictely uni-formly bounded matrix whose mixed moments approach those of q-gaussians? More…
Let n ∈ Z_≥ 1, let μ_1 ≥ dotsc ≥ μ_n > 0 satisfy μ_1+dotsm+μ_n=1, and let X_1,dotsc,X_n be independent non-negative random variables with EX_i=1 for every i. Define Z=∑_i=1^nμ_iX_i, and let T=1+δ with δ>0. Samuels' conjecture. P(Z<T)≥…
Let B be n-dimensional Brownian motion. High-dimensional Brownian motion conjecture. For all sufficiently large n, B is not minimal almost surely; moreover, for all sufficiently large n, its conformal dimension is 1 almost surely. The…
Let ω_n be an n-element uniform sorting network, let S_n denote the permutahedron, and let d_∞ be the distance from a sorting network to a great circle defined by d_∞(ω,c):=max_i∈[1,N]inf_z∈ c|σ_i^-1-z|_∞. A sequence is o(n) in probability…
Let p= r/s be a rational number in lowest terms with even denominator s, and let ^* denote the quantity giving the number of coefficients a_i equal to 1 in a maximal concentration configuration for the Erdős–Littlewood–Offord problem. For…
In the Sherrington-Kirkpatrick model, is the overlapping distribution on the instance almost surely atomic? The same for max-CSP at large density, or at low but finite temperature.
Determine the set of possible triples (Δ=ED_1,ℓ,p(1)) over all scale-invariant random spatial networks.
Can one obtain a comparison principle for rm Var(T(0,nbf e_1))?
For the random quadratic system T_\lambda(x)=\lambda x(1-x) with i.i.d. parameters \lambda_i\in[1,4] distributed by an absolutely continuous probability measure P, does the system have random decay of correlations, equivalently, is it…
Let F_k(m,n) denote the expected cost of an optimal k-assignment in an m× n matrix of independent exponentially distributed random variables with mean 1. Here a k-assignment is a set of k entries with no two in the same row or column.…
Let H_k be a k-regular planar triangulation. At the critical percolation parameter for the event that an open cluster contains a full infinite binary tree, prove that the event has positive probability.
Fix an integer k, and pick x ∈ [n]^d uniformly at random. Let S be a random tile contained in [n], and let B_k be the k-ball around x. Local Bernoulli limit conjecture. The local limit of .S|_B_k as n tends to infinity is a product measure…
Let K be the depth parameter for the binary border aggregation model, let \xi_K$ be the number of particles or the corresponding absorption time, and define m_K=2^K-√2K+frac12log_2K-1/log 2+fraclog_2K4√2K. Expected-time asymptotics…