Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let S be chosen uniformly at random from [n]=0,1,…,n-1. Write P_n^H(k)=Pr(|S-S|=k) for the probability that the diffset has size k, and call k a divot when its probability is lower than the neighboring values in the distribution. For k≪ n,…
Prove that in a scale-invariant random spatial network the subnetwork S(1) cannot be a tree, even allowing Steiner points.
Do macroscopic polarization models for ferroelectric solids arise as the large-body limit of microscopic electron-density models, including the still-open lower-bound direction? In addition, can one systematically analyze the proposed…
Generate a quadrangulation from 2n bits using the Schaeffer bijection and independently resample each bit with probability ε. Determine the noise sensitivity of natural geometric observables; in particular, estimate the probability that…
Well-posedness in the sense of existence of global-in-time smooth solu- tions to (1) is a largely open problem: though in the regime of small initial data or hyperdissipative variants there exist positive results exploiting symmetry and…
Let N=e_1=a_1+…+a_m be the word length, let a^*=max_j a_j, and set N_*=N-a^*. For a uniformly random word with a_j occurrences of the letter j, let M_a_1,…,a_m be its number of inversions, with mean μ=μ(a_1,…,a_m) and standard deviation…
Does there exist a mixing random tiling of the Euclidean plane whose law is invariant under rotations and translations, is stationary under a local clustering-and-rescaling operation, and has a spatial Markov property in which a tile does…
Let π be a random permutation in S_n. For each 1 ≤ i ≤ n - 1, define the random variables \begin{align*} X_i &= \begin{cases} 1 &\mbox{if } \pi(i + 1) 0}}{n} \rightarrow \text{Beta}(1/2, 1/2),] and compute the rate of convergence.
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…
On the n× n grid with a Gaussian free field with no boundary conditions, give every vertex length equal to the exponential of the field. If γ_1(n) and γ_2(n) are shortest paths joining the two top and the two bottom corners, prove that…
How to use RBMs to do statistical inference for a physical system, or properties of a network? How to use RBMs to do statistical inference for a physical system, or properties of a network?
Let (X_n)_n≥ 1 be a sequence of random variables and let (a_n)_n≥ 1 be nonnegative numbers, with A_n:=∑_k=1^n a_k→∞. Assume that there is a constant C<∞ such that, for every 1≤ m≤ n, E|∑_k=m^n X_k|^2≤ C∑_k=m^n a_k. Determine exactly which…
Let G be an infinite network, and let F be either the wired or free spanning forest of G. A Borel set A⊆ 0,1^E is update-stable if, for every oriented edge e of G, the updated forest U( F,e) belongs to A if and only if F belongs to A…
Conjecture: does the limit as γ↓0 of D_γ(1) relate to the TASEP diffusion coefficient, which diverges in dimensions d=1,2 but is finite for d≥3?
Given a collection of redistricting maps, how can you find a distribution or family of distributions explaining these maps? (a) Can we find a good regularization to make the problem better posed? For example, suppose we look at all maps…
Is there a relation between space-filling SLE_κ for κ>8 and the conjectural continuum limit of uniform Eulerian circuits on Z_N^2?
For each n∈N, let X_n be the rotationally invariant random vector denoted by E in R^n, and let Λ_X_n^* be its Cramér transform. Normalized exponential-functional monotonicity conjecture. The function nlongmapsto(Ee^-Λ_X_n^*(X_n))^1/n is…
For the measure-theoretic limit transition densities p_∞(x,y,t) arising from sequences of finite reversible Markov chains, construct a natural topology—such as one induced by an integrated L^2 transition-density distance—that makes the…
For a subset S=(n,f(n),g(n)):n∈N⊂Z^3, characterize the conditions on f and g under which S supports a probability measure on infinite paths with exponential intersection tails.
Let \tau(G) be the minimum number of pairwise edge-disjoint complete bipartite subgraphs partitioning E(G), and let \beta(G) be the largest order of an induced complete bipartite subgraph. For G\sim G(n,0.5), is \tau(G)=n-\beta(G)+1 with…