Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Problem 6.5. • The most glaring case of this problem is the seeming dependence of N N W and its relatives on the crystallographic structure of W. When W is a Weyl group, there are amazing enumerative correspondences with the other Catalan…
Let X be a continuous real-valued random variable, and suppose that ρ_n(X) exists. Sign conjecture. Then (-1)^n+1ρ_n(X)≥ 0. The conjecture is supported in the paper by the observed negativity of ρ_2(X) and by the known nonnegativity of…
Is the set of nonnegative partial tensors that cannot be completed to a joint distribution of independent random variables always convex?
For the posterior random weighted graphs G(t) defined from independent Poisson edge counts and flat priors, study the process gap(G(t)). For large graphs is it concentrated near its expectation under weak assumptions, and how large must t…
Does the full invariance principle hold under the Bricmont-Kupiainen conditions, for d = 2? under a weaker symmetry condition than that of Bricmont-Kupiainen. Work in progress of Bolthausen and the author will prove (1) in the case d = 2.…
For every L≥ 0, there exists a finite constant C(L), independent of the dimension d, such that for every d≥ 1 and every globally L-Lipschitz function B:R^d→R, the Brenier map T transporting the standard Gaussian measure γ_d to…
For the relevant quantum-group random walks, prove or disprove that the completely bounded norm of the transition operator P_{\varphi}=(\operatorname{id}\otimes\varphi)\circ\Delta gives the correct cutoff parameter.
For the integral of a general self-similar Markov process, can one determine persistence and exit-time asymptotics? In particular, can one compute P_x(T_a\wedge T_b>t) as t\to\infty, solve the analogous exit-time problem for the integral…
Let X be a centered Gaussian random vector in R^n with known covariance matrix, and for an orthonormal basis B=(b_1,…,b_n) let N_B=| (⟨ X,b_1⟩,…,⟨ X,b_n⟩)|_∞. Is the Karhunen-Loève basis always optimal for minimizing EN_B over all…
For a probability distribution bf p with finite support, let C_n be the maximum of D(bf p) over distributions whose support has size n, and set C_∞:=sup_n C_n. Let C:=max_bf p∈P_Z_+D(bf p). Support-maximization conjecture. The global…
Let n be a sufficiently large positive integer. For binary words v,w of length at most n, let τ_v and τ_w be their first occurrence times in an iid Bernoulli(p) sequence, and let v be longer than w. Monotonicity conjecture. The number of…
Are random axioms useful in computability theory and Kolmogorov complexity?
572 Oberwolfach Report 10/2023 Together with the fact that P A− \cup A+ \in {0, 1} (proved in [12]), this puts into focus the following open problem: Problem 1. Is P A+ \in {0, 1}? They are also important in stating several intriguing open…
Hitting time comparison Can you compare the hitting times of the interchange process to hitting times for the SRW on a graph G.
Let L^* be the limiting distribution of the persistent ℓ-values, and let LGumbel denote the left-skewed Gumbel distribution with cumulative distribution function F(x)=1-e^-e^x. Left-skewed Gumbel conjecture. The universal limiting…
Let G be the one-skeleton of a bounded-degree recurrent triangulation of an open disk. Prove that Bernoulli site percolation with parameter 1/2 has no infinite cluster.
Let Γ<PSL_2(R) be a cocompact Fuchsian group, and let μ be a finitely supported non-degenerate probability measure on Γ. If ν_μ denotes the harmonic measure of the random walk driven by μ on the boundary ∂H^2≅ S^1, and λ denotes Lebesgue…
Let n≥ 3, and let M be the position matrix of a single-shelf shuffle, with M(i,j)=1/2^i(binomi-1j-1+binomi-1n-j), 1≤ i,j≤ n. For a vector v∈R^n, write v(k) for its kth coordinate. Clay's position-matrix eigenvalue conjectures. The…
Non-backtracking vs. simple random walk Is it true that the lazy non-backtracking random walk (NBRW) mixes faster than the lazy simple random walk (SRW)?
Cutoff profile of random transpositions Can we obtain the cutoff profile for the uniform random transposition walk on S_n?