Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let X^(n)_3 denote the number of distinct adjacent pairs of distinct letters in a geometrically distributed word of length n. Gaussian-limit conjecture. The asymptotic distribution of X^(n)_3 is Gaussian. The claim concerns the limiting…
For each n≥ 1, let ξ_1,…,ξ_n-1 be independent random variables, each uniformly distributed on 0,1, and define P_n(x)=x^n+∑_i=1^n-1ξ_i x^i+1∈Z[x]. Then P(P_n(x) is irreducible over Q)xrightarrow[n→∞]1.
Let n≥ 2 independent arms have distributions X_i~N(μ_i,1), with μ_i∈[0,1] and a unique optimal arm *. Write Δ_i=μ_*-μ_i for i≠ *, H=∑_i≠ *Δ_i^-2, and, for each integer r≥ 0, let p_r=H^-1∑_i≠ *: 2^-(r+1)<Δ_i≤ 2^-rΔ_i^-2. Define…
Let a_1, a_2, a_3, … be a sequence of real numbers (a signal) transmitted in the presence of additive noise such that a_1 + ε_1, a_2 + ε_2, a_3 + ε_3, … is received (both are infinite sequences). We observe X_1, X_2, X_3, … which is…
Problem: Establish the Oleinik entropy condition for the Riemann invariants arising in the hydrodynamic limit of the Leroux system.
Let D(bf p,bf q) denote the discrepancy between the color distributions of the matching left-right pair when the left and right shoes have distributions bf p and bf q. In the equal-distribution case, write D(bf p,bf p). Equal-distribution…
Give quantitative estimates improving the known bound on ℓ^*(Δ), the infimum edge intensity among SIRSNs with mean unit-distance route length Δ. Do minimizers exist, and what structure do optimal networks have?
Let N=4M-5 and let A∈ C^N× M have entries drawn independently from the standard complex Gaussian distribution, where a standard complex Gaussian has the law of a+ib with independent a,b~ N(0,frac12). Let p_M be the probability that the…
Let G^(n) be the finite spatial inhomogeneous random graph, let CC_G^(n)(k) denote its clustering function, and let γ(k) denote the clustering function of the corresponding infinite SIRG. For a sequence k_n→∞, define φ(k_n):= k_n/log k_n…
Is it asymptotically almost surely true that tpW3 pnqq “ n{2 ´ opnq? Is tpn, 3q “ n{2 ´ opnq?} Andrzej Ruciński Fix an alphabet A with |A| “ k ě 2 and consider words w P An . Definition 19. Define a pair of subwords w1 , w2 of w to be…
We propose efficient coding schemes based on random linear models with approximate message passing (AMP) decoding, and study the tradeoff between energy-per-bit and achievable user density for a fixed target error rate. Open problems: This…
Let M_n be sets of mirrors and let Λ denote the measure on light rays. The sets M_n are required to satisfy the conclusions of Theorem 16.2 except condition (b), namely the exceptional-set condition concerning rays that reflect exactly…
Let (Y_k)_k otin V be a family of N random variables admitting a dependency graph of degree D∈Z_≥ 0. Assume that there exists δ∈(2,3] such that A_δ<∞, where A_δ=∑_k∈ VE[|Y_k-c_k|^δ], and let W be the standardized sum and ξ_δ the…
Let R be the geodesic Radon transform on probability measures on the sphere S^(n-1), sending a measure to its equator averages, and let d_Wp be Wasserstein-p distance. Does there exist a uniform reverse inequality d_Wp(mu,nu) <= C'(p,n)…
Let L/K be any cyclic p-extension of degree p^N, with N ≥ 1, and Galois group G. Assume that L/K is ramified at r ≥ 1 places of K, totally ramified in L/K. Binomial-law conjecture. The orders of each of the two factors, class and norm, in…
Is there a scaling limit for the distribution over partitions generated from running ReCom on finer and finer grids on the unit square.
Let H_k be a k-regular planar triangulation. At the critical percolation parameter for the event that an open cluster contains a full infinite binary tree, prove that the event has positive probability.
Let d≥1, and let SAW_∞ be the space of infinite self-avoiding walks. For a walk η, write η[i,∞) for its tail and η[0,k]=ζ' for its initial segment. Symmetric domain Markov property conjecture. For all d≥1, there exists a unique probability…
Determine optimal strong convergence rates for temporal discretizations of the stochastic Cahn-Hilliard-Cook equation.
Characterizing stochastic processes that one can put into formulas instead of random walks.