Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let x_1,…,x_n∈R^d be independent standard Gaussian vectors, and let n=n(d) as d→∞. The ellipsoid fitting conjecture predicts a sharp threshold at n/d^2=1/4: if limsup_d→∞n/d^2<1/4, then with probability tending to 1 there exists a…
Let a_1(x,t,u) denote the first component of the Feynman checker amplitude at position x and time t in the external field u, and define u(x+1/2,t+1/2)=-1 if both x and t are even and u(x+1/2,t+1/2)=+1 otherwise. Direction-reversal…
Give a tight upperbound to E| A^⊗ k -E A^⊗ k |.
Consider a Markov queueing system where there are N servers who serve at rate 1, and new customers arrive into the system at a constant rate of λ. When a new customer arrives, they choose to join the queue behind the server with the…
Stochastic Hamilton-Jacobi equations ∂_th=F(∇ h)+Δ h+ξ_ε with F scaled appropriately.
Let (X_n)_n∈Z be a centered strictly stationary sequence with E[X_0^2]<∞. For k≥1, define φ_X(k)=sup_msup|P(B| A)-P(B)|: A∈σ(X_j:j≤ m), P(A)>0, B∈σ(X_j:j≥ m+k), and assume φ_X(k)→0. If S_n=∑_j=1^n X_j and Var(S_n)→∞, prove that…
For a logarithmic random set A\subseteq\mathbb N, with each i selected independently with probability 1/i, determine \max_x r_A(x), where r_A(x) counts representations of x as a sum of elements of A.
Let T be the tensor space and define T^(R)=T∈T:rankT≤ R. For L>1, let Z_l=|E[R,l]| and define F_L[β]=P(Z_L≤sin(β)Z_L-1≤…≤(sin(β))^L-1Z_1). DCPD distributional convergence conjecture. There exists at least one absolutely continuous…
What kind of distributions can be represented by an RBM as opposed to directed models? What kind of distributions can be represented by an RBM as opposed to directed models?
For random combinatorial optimization problems such as minimum spanning arborescences, non-bipartite perfect matchings, and symmetric or asymmetric traveling-salesman problems with i.i.d. uniform or exponential edge weights, is the…
Q: (Brown measure of unbounded operators): As defined by (Haagerup and Schultz), ∆( T ) makes sense for T ∈ M ∆ where M ∆ = { T ∈ ˜M | ∫ ∞ 0 log t dμ T (t) < ∞ }.Then ∆( T ) = exp( ∫ ∞ 0 log t dμ T (t)) ∈ [0, ∞]. Can one make sense of μT…
Start with n tetrahedra and glue their faces together at random. The vertex links need not be spheres but are essentially random triangulated surfaces; call the resulting space a pseudomanifold. Investigate the properties of these…
The Cramér–Wold theorem determines a probability measure on ℝᵈ from its values on halfspaces. Under what conditions does an analogous uniqueness result hold for signed measures, not necessarily nonnegative, that may have infinite mass near…
Determine the conformal-dimension and \ell^p-cohomology critical-exponent behavior for the Sierpiński carpet and the Sierpiński gasket, in particular the relevant critical exponents p(\mathcal{J}(X,d)).
Let p_1,p_2,…,p_n ≥ 2 be a sequence of integers. Let X_1,X_2,…,X_n be independent random variables such that X_k is uniformly distributed on the set p_k-1,p_k-3,p_k-5,…,1-p_k . Kuperberg's mixed-base conjecture. There are unique constants…
Let D⊂R^2 be a connected open set with smooth boundary, and let X,Y be synchronously coupled reflected Brownian motions in D driven by the same planar Brownian motion. (i) Does there exist a bounded such domain for which…
For geometrically nonlinear differential inclusions, is there a critical threshold separating rigid and flexible regimes, and can one bound the maximal regularity of irregular solutions? Can scalar nucleation models for shape-memory alloys…
Problem 2. 2. (C. Kriloff, V. Reiner) This is a possible systematic approach to
Can the collection of spanning forests on a pair of graph partitions be used to make define a notion of distance between them or characterize their similarity?
Let S_n=S_0+X_1+…+X_n be a renewal process whose i.i.d. strictly positive recurrence times have infinite mean and a non-lattice distribution. If A_t is the age, B_t the residual life, D_t=A_t+B_t, and U_t=A_t/D_t, does U_t converge in…