Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let rm bf ID(rhd) denote the class of monotonically infinitely divisible probability measures on R, and equip the space of probability measures with the weak topology. Weak-closedness conjecture. The set rm bf ID(rhd) is weakly closed. The…
Let N_n( R) be the number of real zeros for a Kac polynomial with coefficients that are iid copies of a real variable ξ. Show E N_n( R) = frac2π log n + C_ξ + o(1), where C_ξ is a constant depending on the distribution of ξ. If possible,…
Let c ≤ C be positive constants. Let A be the random matrix of size n whose entries are independent random variables with mean zero and variances between c and C. Polynomial-factor concentration conjecture. With probability tending to one,…
Run two walks with a common clock on Z^d, each choosing uniformly among neighbors not previously visited by the other walk. Prove that in d=2 one walk is almost surely trapped in a finite region, while in higher dimensions neither walk is…
For every infinite vertex-transitive graph G, prove that Bernoulli percolation has no infinite cluster at criticality, i.e. θ_G(p_c(G))=0.
Let T be a tree on n vertices. Write P_n for the path and S_n for the star on n vertices, and let P(T) denote the first-player win probability when both players play uniformly at random. Path–star extremal conjecture. For every tree T on n…
Let the symmetric Neuhauser–Pacala model be the competing-species system on the lattice Z^d, with coexistence meaning that both species persist in the long term. Neuhauser–Pacala coexistence conjecture. There is coexistence in the…
Let S_k denote the permutations of [k]. Fix ε>0 and set n=(1+ε)k^2/4. For π∈S_k, let σ be a uniformly random permutation of length n. Fixed-pattern containment conjecture. With high probability, σ contains π. The statement is a weakening…
In cases where we know all Tate classes are in the image of C^i⊗ mathbbQ_ℓ, what can we say about the image of C^i⊗ mathbbZ_ℓ? For instance, for which primes ℓ can we have non-surjectivity? Comments: Koll'{a}r proved that if we take a very…
What is the power of a shared random string known to several parties in a system who wish to perform some joint task? Shared Randomness: Friend or Foe? Moni Naor (joint work with Shahar Cohen and Adar Hadad)
Let a quantum graph be a metric graph with edge lengths, and let the nodal domains of an eigenfunction be the connected components of the complement of its zero set. Consider well-connected graphs with incommensurate bond lengths, and the…
Let X_1, X_2, … be i.i.d. random variables with mean 0 and variance 1, and let S_n = ∑_i = 1^n X_i. For b > 0, let T_b be a sequence of random times. The following theorem is due to Renyi (1961): \begin{theorem} If T_b/n_b oversetp→ 1 as b…
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?
Let β[0,s] be the path of Brownian motion on the three-dimensional torus T^3 up to time s, and let Δ_s be the Laplacian on L^2( T^3backslashβ[0,s]) with Dirichlet boundary condition on β[0,s]. Write (λ_j,s)_j∈ N for the eigenvalues of…
Let H be a fixed connected graph, let G_n,p be the Erdős–Rényi random graph, and let X_H denote the number of copies of H in G_n,p. Define m(H)=maxe(J)/(v(J)-1):J⊆ H, v(J)≥ 2. If p=p(n) satisfies p≫ n^-1/m(H) and n^2(1-p)≫ 1, then X_H…
For independent bond percolation on the hypercubic lattice Z^d with d ≥ 2, let θ(p) be the probability that the origin lies in an infinite cluster, let χ(p) be the susceptibility, and let p_c = inf{p : θ(p) > 0} = sup{p : χ(p) < ∞}.…
Given random trees T_n with uniformly random and-or labels, does the sequence of Boolean functions computed by T_n converge in distribution as n tends to infinity, when is the limiting distribution degenerate, and what can be said about it…
Let G=(V,E) and G'=(V,E') be connected graphs with the same vertex set V, where E'=E∪x,y for some x,y∈ V. Write λ_c(G) for the critical infection rate of the contact process on G. Pemantle–Stacey conjecture. The critical rates are equal:…
What properties of the geography or political geography can be read off the graph adjacency data alone?
Let D be the unit ball, let ( K_D,d_H) be the space of compact subsets of D equipped with the Hausdorff metric, and let Γ be the set of simple paths starting at 0 and meeting ∂ D only at their endpoint. Let K_1 and K_2 be random elements…