Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For an invariant random measure ξ, is invariance of its distribution under invariant mass-preserving transport kernels characteristic of mass-stationarity?
On Z^2, take nearest-neighbor jump probabilities p_1,q_1,p_2,q_2 in directions ± e_1,± e_2, with p_1>q_1 and p_2>q_2. If the angle between v and the mean vector (p_1-q_1,p_2-q_2) is less than π/2, prove that there is a stationary…
If r_k(n) is the maximum size of a k-term-AP-free subset of [n], is the number of k-AP-free subsets of [n] equal to 2^{(1+o(1))r_k(n)} as n\to\infty?
Q: More generally, given a negative definite function on a group Γ (i.e. aDirichlet form), we know it gives a representation by affine actions on L2Γ. When is it a multiple of the left regular representation? What conditions on the…
Let S_m,n be the set of multiset permutations under consideration, let π be uniformly random in S_m,n, and let L^1_m,n(π) be the continuously increasing subsequence statistic. Non-central moment conjecture. For all r≥ 1, if n is…
Problem 4.1 (R. Charney), Questions about classification. (1) Given an arbitrary poset P, when can it be given a Garside labelling? When such a labelling exists, say that P is a Garside poset. (2) Given a Garside poset P, what are the…
To state the conjectured generalizations of (3) and (4), we first introduce (what we conjecture is) the correct notion of stability, which is compatible with an appro- priate determinantal representation, via the following lemma. where…
Let μ∈P(R^d) be an isotropic distribution, meaning that ∫ x dμ(x)=0 and ∫ xx^T dμ(x)=I_d. Let ν_n denote the normalized n-fold convolution sequence from the central limit theorem, so that ν_n converges in law to the standard Gaussian…
How does one find examples of CFTs? Theories (CFT). A CFT is characterised by a minimal set of so-called primary random fields Vi defined on Rd and their correlation functions Yn h Vi (xi )i i=1 where S a local action functional. The…
Can continuum equations such as the Boltzmann equation be rigorously derived as scaling limits of deterministic many-particle dynamics, in particular for ballistic annihilation with random initial data?
Let X and X' be discrete-time stochastic processes on the same state space, and let θ_n denote the shift. If P(θ_nX∈ A)→P(X'∈ A) for every measurable path-space set A, must P(θ_nX∈·) converge to P(X'∈·) in total variation?
Let W_N be the normalized partition function of the two-dimensional Gaussian polymer, let λ(hatβ) denote the model-dependent parameter appearing in the moment estimates, and define q_⋆^2(N,hatβ)=2/λ^2(hatβ)log N. Weak-disorder moment…
Informally, this question is asking whether for large sparse graphs which are expanders, the size Ramsey number is controlled by the construction coming from random graphs. The report passage is retained verbatim as the relevant context…
For a free-boundary problem on a random domain D(\omega) with random diffusion, what is a suitable model ensuring that D(\omega) is almost surely well-defined, how should the expectation of a random domain be defined, and how can the…
Consider the interchange process with n particles on n vertices. Can you say the following? t_mix^IPlesssim t_mix^SRW log n , t_mix^IP lesssim t_mix^SRW,n , t_mix^IP asymp t_mix^SSEP,n/2 .
For each integer sgeqslant2, the s-type growth model on Z^2 allows s colours, and an uncoloured site is infected at rate 0, 1, or ∞ by a colour according as it has zero, one, or at least two neighbours of that colour. A finite initial…
The connection with the Brownian loop measure remains an open problem. We consider the stochastic geometric heat equation given by (1) \partialt u\alpha = \partialx2 u\alpha + Γ\alpha \beta \gamma \alpha \alpha \beta\gamma (u) \partialx u…
For integers L≥ N≥1, let P be any nearest-neighbor monotonic path in Z^d of length N, and let X_n_n≥0 be a d-dimensional simple random walk starting at 0. Define the straight coordinate-axis path…
Let m and n be positive integers. For a random permutation π of a multiset containing n copies of each card type 1,…,m, let L(π) be the largest integer p for which there exist indices i_1<…<i_p with π_i_j=j for every 1≤ j≤ p, and set…
There is also a frac1poly(n) lower bound for the probability that a uniformly random spanning tree of an n-vertex complete graph is k-splittable. If you plot 2-splittability probability as a function of k, it's not unimodal. If it was,…