Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Question: Does strong disorder imply superdiffusivity?
Problem 3. 3. (D. Bessis, F. Chapoton) The Lyashko-Looijenga mapping associates to any complex-valued function on a manifold the polynomial in one variable whose roots are the critical values of the function. The main theorem in [34]…
Let F_m be the set of periodic sequences from the Fibonacci recurrence or its parity transform with initial condition (a_0,a_1)∈( Z/m Z)^2, taken modulo m. For a divisor d of a composite modulus m, define the weight of a period q of length…
Prove or disprove: there exists a universal constant C such that, for any choice of n symmetric matrices H_1,…,H_n∈R^n× n satisfying |H_k|≤ 1 (for all k=1,…,n ), there exists ε_1,…,ε_n ∈ ±1 such that | ∑_k=1^n ε_k H_k | ≤ C √n.
Let G denote the event of infinite coexistence in the two-type Richardson model on Z^d, with infection intensities normalized to 1 and λ for the two types, respectively. For d e 2, the model is started from the fertile initial…
Let n∈N. For a full-rank lattice Λ⊂R^n, write det(Λ) for its determinant and λ_1(Λ) for the length of a shortest nonzero vector. For B>0, choose vectors independently and uniformly from Λ∩[0,B)^n. Lattice-generation conjecture. For every…
For every graph and every distribution of linear growth, does the set G(J) of spin-glass ground states satisfy |G(J)|\in{2,\infty}? More generally, is there a connection between random walks and spin-glass ground states on graphs beyond…
Prove for n-point lattice point sets an upper bound of the same order as the known expected Lp discrepancy bound for random point sets.
Let r_p(D) be the p-rank of the class group of Q(√−D). As D ranges from 0 to X, what is the average value of p^{r_p(D)}, what is the probability distribution of r_p(D), and what upper bounds for r_p(D) in terms of D hold? Let n(D) be the…
For a specification on \mathbb{Z}^d with a unique Gibbs state, is it true that for every \varepsilon>0 there is N such that, for all n\ge N, every pair of boundary conditions outside the n-box induces inside-box measures that can be…
Let Z_1 be a standard Chernoff random variable with density f_Z_1. Let φ(x)=(2uppi)^-1/2exp(-x^2/2) be the standard normal density. Quantitative strong log-concavity conjecture. For σ≥σ_0≈0.541912…=(-.(log f_Z_1(z))”|_z=0)^-1/2, there is a…
Open problems: We presented a min-entropy power inequality for sums of N independent random vectors in Rd , with a constant that is independent of N but sharp for any fixed dimension d. Min-Entropy Inequalities on Algebraic Structures…
For every integer n≥ 2, let X=(X_1,…,X_n) be a centered Gaussian vector satisfying Var(X_i)=1 for every i. Let Z_1,…,Z_n be independent standard Gaussian random variables and set overlineZ=(Z_1+…+Z_n)/n. Then, for every t∈R, Pmax_i X_i≤ t≥…
Let I(A,B,C,D) be the parameter interval from Proposition, let (Y_t)_t∈ I be the Markov process constructed there, and let F_s,u denote the sigma-algebra generated by the process outside the interval (s,u). For s<t<u in I(A,B,C,D), set…
Let X_d,n be the size of a uniformly random (n,dn-1)-core partition with distinct parts, with mean μ_d,n and standard deviation σ_d,n. Fix d and let n tend to infinity. Fixed-d normality conjecture. For fixed d, the distribution of X_d,n…
Determine whether there exist universal constants C,c>0 and a polynomial-time online signing algorithm such that, for every dimension n≥ 1 and every finite horizon T, when v_1,…,v_T are independent samples from N(0,I_n), the algorithm…
Modify the above scheme by adding a new `mutator' ball to each of player A's urns. When this ball is selected, player A invents a new signal and sends that. Player B responds by guessing a state uniformly at random. If this guess is…
For every connected bipartite graph G with n vertices and every chosen vertex v∈ V(G), let F_G be uniformly distributed over the finite set f:V(G)→Z: f(v)=0 and |f(x)-f(y)|=1 for every xy∈ E(G). Define the range by Range(f)=max_x∈…
Problem 3. (V. Reiner) Let W be a finite Coxeter group, and let T be the generating set of all reflections, as in Section 1. Again, let denote the word length on W with respect to T. This is often called the absolute length on W. In…
Let β>0, and for distinct edges write P_β[e_1,…,e_k] for the probability that all listed edges occur in the forest. Negative association conjecture. For distinct edges ij and kl, P_β[ij,kl]≤ P_β[ij]P_β[kl]. More generally, for all distinct…