Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Construct a scale-invariant random spatial network that is visually realistic, in the sense of not looking very different from a real-world road network.
Stochastic Hamilton-Jacobi equations ∂_th=F(∇ h)+Δ h+ξ_ε with F scaled appropriately.
Let b[200~σ be the parameter of the Ewens distribution on permutations of [n], and let 0≤γ<δ<1. Consider the number of cycles whose lengths lie in [γ n,δ n]. For a positive integer k, suppose that 1/k+1≤γ<δ<1/k. Ewens cycle-count…
Let S_n be the symmetric group, and consider the involution walk whose step distribution depends on a parameter p. Order the conjugacy classes by cycle lexicographic order. Cycle-lexicographic likelihood-order conjecture. For p ≥ 1/2, the…
For critical dynamical percolation and the left--right crossing event C_Q of a square Q, is the tail probability conjecturally bounded by \mathbb P[\omega_s\in C_Q for all s\in[0,t]]\leq\exp(-t^{2/3+o(1)}) as t\to\infty?
Let p∈[frac12,1] and ε∈[0,1) be the parameters of the random walk, and let B be the set of bad configurations. A configuration is good when it is not in B. The paper's condition (EG2) asserts the existence of a neighborhood of (1,0) in the…
For each n≥ 1, let D_n be the number of descents of the stack-sorted image of a uniformly random permutation in S_n, and define Y_n=fracD_n-(3-e)n√n. Central limit conjecture. The sequence (Y_n)_n≥ 1 converges in distribution to a random…
For a d× d real Gaussian matrix G_R and complex Gaussian matrix G_C, both normalized to entry variance 1/d, define α_K(d)=d^-1E∑_k=1^dσ_k(G_K). Is α_R(d) monotonically increasing in d, and is α_C(d) monotonically decreasing in d?
For the totally asymmetric simple exclusion process (TASEP), classify the initial conditions that yield a common scaling-limit distribution and common limit process for particle-position fluctuations.
Determine useful applications of CPH-maps, CPH-semigroups, and CPH-dilations, including whether these structures yield significant new dilation or operator-theoretic results.
Let (s_i)_iu2208 [2n-1]_0 be a sequence of initial strengths, and let (tilde T_i)_i∈ [2n-1]_0 be the teams reordered from weakest to strongest according to these strengths. Write tilde W_n(i) for the number of wins of tilde T_i at the end…
What is the universality class of random band matrices as the matrix size N tends to infinity while the band width W varies, including across the localization-delocalization transition?
Let S be a finite subset of the plane equipped with Euclidean distance, and let π_1,2 be the corresponding distribution mapping. For an initial distribution on S, consider the iterates of this mapping. Planar π_1,2 convergence conjecture.…
In the balanced regime 0<α<1 and β>2α, prove that the upper and lower growth exponents for influence and city population all equal β/(2-2α+β) and those for nearest-city distance equal (α-1)/(2-2α+β).
Take a (random) d-regular graph, and consider the anti-ferromagnetic Ising model, \textit{i.e.} J_ij=-1 for all i,j. Can we show show fast mixing O(nlog n) up to (d-1)tanh(β)<1 ?
For simple random walk (X_n) on the uniform infinite planar triangulation, prove that the graph distance from the starting point has exponent 1/4, in the sense that d_gr(X_0,X_n)asymp n^1/4 up to the intended subpolynomial or constant…
Let D⊂R^d and let a log-correlated Gaussian field on D admit a smooth white noise decomposition. Denote its derivative Gaussian multiplicative chaos by D_∞(mkern 1.5muoverlinemkern-1.5muγmkern-1.5mumkern 1.5mu), and let mkern…
It could also come as a surprise that the size of \sqrt{ } the smallest detectable tree transitions from the order of magnitude log2 n to n as the mean degree pn increases, and understanding this transition remains an intriguing open…
Determine the mixing rate of the Markov chain on triangulations that repeatedly flips a uniformly random flippable edge.
Open problems: \begin{enumerate} \item \textbf{Entropy power inequality} N(Z) ≥ η N(X) + (1-η) N(Y). \item \textbf{Monotonicity in the CLT} H(U_n) ≥ H(U_n-1), n = 2, 3, … \end{enumerate}