Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Is there a many-body problem where these kinds of partitioning algorithms can give a speedup when used for processor assignment? This is a dynamic problem where processors can only talk locally to each other and you are allowed to reassign.
On the bidirected torus Z_N^d with fixed d≥3, let b^(N),t^(N),m^(N) count excursions of a uniform Eulerian circuit longer than N^d/ω_N, shorter than ω_N, and between those scales. For sufficiently slowly growing ω_N, does…
Fix ε>0. Let g_ε(N) be the least k such that, for every abelian group G of order N, a uniformly random k-element subset A⊆G satisfies with probability tending to one that |F_A(g)-2^k/N|≤ε2^k/N for every g∈G, where F_A(g)=|S⊆A:∑_x∈Sx=g|. Is…
Let (X_i, Y_i)_i = 1^n be i.i.d. pairs of random variables, where X_i ∈ R^p and Y_i ∈ R^q. \begin{itemize} \item[1.] Find a ∈ R^p and b ∈ R^1 such that [\text{corr}\left( a^TX, b^T Y \right)] is maximized. \item[2.] Pick hata, hatb such…
Let A_n be an n× n matrix with independent and identically distributed Rademacher random variables, taking values ±1 with equal probability. Write gp_n=P(A_n is non-invertible). The notation a_n=o(b_n) means lim_n→∞a_n/b_n=0.…
Let Ω_n=-1,1^n with normalized uniform measure, and let ∇ and Δ denote the Walsh gradient and Walsh Laplacian, respectively. The conjecture asks whether, for every 1<p≤ 2, there is a constant C<∞ independent of n such that for every n∈N…
For d≥2, let L_d^R(r)=x∈[0,1]^d | ∑_i x_i=r, and let U(L) denote the uniform distribution on a set L of nonzero finite measure. A triple of distributions is jointly mixable if it has a coupling whose componentwise sum is almost surely…
Problem 2. (C. Athanasiadis) Define the q-Fuss-Catalan numbers q-Cat (k)(W ):= n ∏ i=1 [kh + ei + 1] q [ei + 1] q, (1) where [ n]q = q + q2 + · · · + qn is the usual q-analogue of the positive integer n. Show that q-Cat (k)(W ) is a…
Random matrices with external source. More general cases Study the random matrix model with probability measure 1/Z_Ne^-Ntr(V(M)-AM), where A is an N× N diagonal matrix with eigenvalues ± a (each with equal multiplicity N/2, assuming N is…
What moment inequalities can be deduced from positive semidefiniteness of moment matrices?
Problem 1.2. What are the largest natural domains of definition for the families N C W, N N W and ∆ W, and for their corresponding applications? In a sense, the broadest setting possible for the numerology is finite groups generated by…
In the partial-tensor completion problem for joint distributions of independent random variables, determine the degree of the algebraic-boundary hypersurface H and whether the set of nonnegative partial tensors that are not completable to…
Let (G_n) be a bounded-degree expander family converging locally to an infinite graph G. Prove that the finite-graph percolation thresholds p_c(G_n) converge to p_c(G).
For a one-dimensional atomistic system with repatom coordinates X_r and eliminated coordinates X_c, define the reduced free energy A(X_r)=−β⁻¹ log∫exp(−βV(X_r,X_c))dX_c. Can the free energy per removed particle, A(X_r)/N_c, be computed…
Does the stationary exclusion-process current fluctuation limit with T^{1/3} scaling and the Baik-Rains distribution, established for ASEP, continue to hold for general stationary exclusion processes with non-nearest-neighbor jumps?
How long may it take for a crossing event to disappear in dynamical percolation?
Let G be a planar graph and consider Bernoulli percolation at p=1/2. If an infinite open cluster exists almost surely, prove that there are almost surely infinitely many infinite open clusters.
Let Assumption hold, with even ν. Assume that a_k,l^z=0 whenever knot≡ lpmod 2, for every z∈+,-,0,1, and suppose that P_0φ[2l]=0 for every l∈N such that 2l<ν. Here P_0 is the projection onto the relevant kernel component, φ[2l] are the…
In the inhomogeneous model for which the pair (F_-,F_+) produces a `pyramid' on the asymptotic shape, does that imply that rm Var(T(0,nbf e_2)) is order n, and that T(0,nbf e_2), properly rescaled, satisfies a Gaussian central limit…
Let D be a fair balanced non-transitive set of dice, represented by a word over three letters x, y, and z. The length of D is the length of this word, and two words are similar when one can be obtained from the other by the exchanges…