Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let n be a positive integer and let j be a positive integer. A lucky spot is a parking spot occupied by a car whose preferred spot is that spot. Let f_j(n) denote the polynomial appearing in the claimed formula, and let r_j be a rational…
For every prime power q and every p∈(0,1-1/q), let H_q(p) denote the q-ary entropy. As ε→0 with 1-H_q(p)-ε>0, a random linear code C⊆F_q^n of rate 1-H_q(p)-ε is, with probability tending to 1 as n→∞, (p,L)-list-decodable for…
Determine the maximum divergence of RBM_3,1. Determine the maximum divergence of RBM_3,1.
Let G be an infinite graph, and let X_n denote the directed edge-reinforced random walk on G. For each circuit C in G, let T^C be the event that the walk becomes trapped in C, and let d(·,·) be the shortest-path distance on G. Dichotomy…
Fix a critical initial law with (p(0),λ(0))∈C. Let N^t_t be the set of red leaves at time t, let X^t_t(u) be the mass of u∈N^t_t, and let N_t=#N^t_t. For positive real numbers x_t satisfying x_t/t→ x∈R_+ as t→∞, consider the empirical…
For p∈[0,1], let the frog model with drift parameter p have maximum speed, namely the limiting speed of its rightmost frog, denoted by v(p). Concavity conjecture. The speed of the maximum is a concave function of p; that is, for all…
For any ε>0, give sufficient, explicit (efficiently checkable) conditions, holding with probability ≥ 1-ε for a sequence of iid standard Gaussians, on a deterministic sequence a_k_0≤ k≤ n of real numbers for the associated polynomial…
Prove the existence and uniqueness of the KPZ universality class fixed point introduced by Corwin-Quastel in 1 spatial dimension. That is to say, consider any growth process h(t,x) and show that for an appropriate centering function…
famous Mandelbrot’s conjecture. Finally, it was proved by Kiefer \sqrt{ }and Mörters [8] that the dimension of double points on the Brownian frontier is ( 97 + 1)/24. The computation of the exact Hausdorff dimensions of the Brownian…
Let X_1,…, X_n be iid random vectors in Z^d. A choice of weights w_i∈ -1,1 should exist such that, for all non-zero a_i∈ R and all x∈ R^d, P(a_1X_1+…+a_nX_n = x)≤ max_k∈ Z^dP(w_1X_1+…+w_nX_n=k). The paper presents this as a more general…
How do we know how far apart two redistricting maps are? Can you capture the number of steps it takes in a Markov chain or political characteristics? What does the topology of the space of maps look like under such a metric? What is the…
Is it true that tropical RBMs always have expected dimension? Is it true that tropical RBMs always have expected dimension, meaning equal to the number of parameters within the model or the dimension of the ambient probability simplex?
Let X^(1),X^(2),… be independent and identically distributed d-dimensional observations with independent Exponential(1) coordinates, and let S_d-1 be the probability simplex. Let σ_n be the almost surely unique maximum of X^(1),…,X^(n)…
Problem 1: cylinder decompositions in large genus We consider limits of square-tiled surfaces when the number of squares N and the genus g tend to infinity. In this first problem we first let N tend to infinity and then let g tend to…
Let G be a planar graph and consider Bernoulli percolation at p=1/2. If an infinite open cluster exists almost surely, prove that there are almost surely infinitely many infinite open clusters.
Give a mathematically useful definition of a process being a 'martingale for practical purposes', so that failure means it is practical to find a stopping time T with EX_T≠EX_0. For a discrete process X_0,…,X_n, can a natural…
- Does the measurable local lemma hold for every probability-measure-preserving action of every group?
Does the measurable local lemma hold for every probability-measure-preserving action of every group?
Tasks arrive as a rate-one Poisson process and have types in [0,1]; batch processing time S is monotone and strictly subadditive and type a incurs waiting cost rate c(a). Is there an explicit online algorithm and universal constant C whose…
Efficient methods to train RBMs with fixed, sparse connectivity What are the most efficient learning algorithms for training sparsely connected RBMs?
Let L,R^⋆ be the set of finite words over L,R, and let P_v denote the probability measure on Z attached to the tree node indexed by v. For a word v, write P_v(N) and P_v(-N) for the masses on the nonnegative and nonpositive integers,…