Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Consider the detachment process coupling all n-detachment processes on one probability space. Let hatτ^(n), for n=2,3,…, be the corresponding first detachment times, and define, for k≥ 1, M(k):=maxn: hatτ^(n)≤ k, with M(k):=1 when no two…
Can we characterize tensors of non-negative rank at most 3 using the description of RBM_3,2? Is it possible to use the implicit description of RBM_3,2 to determine the characterizing properties of non-negative rank ≤ 3 tensors?
Problem 6. (H. Thomas, A. Zelevinsky) When W is a noncrystallographic finite Coxeter group, give a geometric construction that realizes ∆ W as a convex polytope. There is a realization of ∆ W in all types as a complete simplicial fan, but…
If a t-coset is a coset of the stabilizer of t points in the symmetric group S_n, is every partition of S_n into t-cosets a refinement of a partition into (t-1)-cosets?
Let hatτ^(n) denote the first detachment time in the n-detachment process. Scaling-limit conjecture. The random variables frachatτ^(n)n^2 have a limiting distribution as n→∞. This conjecture concerns the asymptotic behavior of the first…
Let σ and r be fixed positive integers, with σ>r, and let X_σ,n denote the longest temporal period of a periodic solution for the random-rule cellular automaton described in the paper. Then the normalized variable fracX_σ,nn^σ/2 converges…
An interesting open problem is whether there exists a finitely dependent invariant process which cannot be expressed as an ffiid with finite expected coding radius. Markov random fields. Another class of processes of interest are Markov ran-…
How small can such a planted tree T can be while still leaving a detectable property in G(n, p) \cup T ? Theorem 1 (Possibility of detecting most known trees). Let p = c/n. There is a constant C such that the following holds. Let T be a…
Part (3) of the problem: Let s≤ d≤ m and z_1,…,z_m∈ R^d i.i.d. random vectors with i.i.d. entries ( z_k)_j = rcc -frac1√s with probability s/2m 0 with probability 1-s/m frac1√s with probability s/2m . Note that E z_kz_k^T = frac1m I_d× d.…
Problem 3. 2. (N. Reading) Let W be a finite Coxeter group. In [41], Nathan Reading defines the notion of Coxeter-sortability for elements of W, relative to some Coxeter element c.There are natural maps nc and cl from the Coxeter-sortable…
How can we design architecture and optimization to train well \emph{in practice}?
For every n∈N and every random vector X=(X_1,…,X_n)∈±1^n, there is a universal constant C>0 such that, for every integer t≥1, one can condition on a set S⊆[n] with |S|≤ Ct so that the remaining conditional correlations satisfy a bound of…
Let d≥ 2 and let l∈ S^d-1. A random walk in a uniformly elliptic i.i.d. random environment is transient in the direction l if lim_n→∞X_n· l=∞ P_0-almost surely, and it is ballistic in the direction l if liminf_n→∞X_n· l/n>0 P_0-almost…
Let \varepsilon>0 and let independent finite-support random vectors v_1,\ldots,v_m\in\mathbb C^d satisfy \sum_{i=1}^m\mathbb E(v_i v_i^)=I_d and \mathbb E|v_i|^2\leq\varepsilon. Then \Pr\left(\left|\sum_{i=1}^m v_i…
Let t∈ Z and consider the full-space Beta random walk in random environment. For each x∈ Z, let Z_t^ Z(x) denote the full-space point-to-line observable. Full-space Gamma-distribution conjecture. The sequence ( Z_t^ Z(x))_x∈ Z is iid, with…
Let μ be a probability density on R, with positive density near 0. Let X_1, X_2, …, overseti.i.d~ μ, and define the harmonic mean [H_n = \frac{n}{\frac{1}{X_1} + \cdots + \frac{1}{X_n}}.] Prove, using Stein's method, that H_n converges to…
Problem 5.1. • Explain the theory of cluster algebras in infinite types. See
In competing first-passage percolation on a finite-variance configuration model, can a weaker type capture a positive fraction of vertices by starting at high-degree vertices while the stronger type starts at a low-degree vertex?
For |\lambda|>2, conjecturally the almost-sure spectrum satisfies \Sigma_\lambda=\sigma(h_{\nu^*,\lambda})\cup\sigma(h_{\omega^1,\lambda}); is this equality true?
For a∈(0,1], let C_a=(x,y)∈Z^2:x≥ 0,lvert yrvert≤ ax. Let s_a=m1_C_a be the divisible sandpile with mass m on C_a, and let s_0=kx1_x>0, y=0. Sharpness conjecture. The divisible sandpile s_a stabilizes if and only if 2ma/1+a^2≤ 1.…