Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let z~N(0,I_n) and, for an n× n correlation matrix Σ, define M(Σ)=min_1≤ i≤ n|(Σ^1/2z)_i|. Define the cosine covariance by Σ^cos_ij=cos(π(i-j)/n). Cosine covariance conjecture. For every n≥ 1, every correlation matrix Σ, and every t≥ 0,…
Let W be the Cantor set D_1 and let R=Co(W) be the countable atomless Boolean algebra. Let I be the set of finite binary strings, including the empty string, and let A_i∈ R| i∈ I be a binary tree of non-zero elements of R generating R,…
Let H_2m be the 2mth harmonic number, and let F^G(n,m) denote the expected number of correct guesses made by the strategy G for a deck of n cards subjected to an m-shelf shuffle. Assume that n/m is not too small. FDH optimality conjecture.…
Let p_c denote the critical probability for site percolation on the square lattice. For a positive integer n, set B=[0,4n]×[0,3n] and A=[n,3n]×[n,2n]. Starting from site percolation on B with density p_c, destroy every occupied cluster…
For β>0, let the generalized Gaussian have density G_β,p(x)=α(1-β|x|^2)_+^1/(p-1), where β and alpha are chosen so that it integrates to one. Let X_j, j=1,…,n, be independent random variables with densities f_j, and let Z_j be independent…
Determine the computational hardness of decoding from random linear codes.
Heuristic for the refinement of the abc conjecture: for coprime positive integers a,b, the kernels k(a), k(b), and k(a+b) may be modeled as independent random variables.
Determine the set of possible triples (Δ=ED_1,ℓ,p(1)) over all scale-invariant random spatial networks.
Does there exist a feasible coloring for the final graph, G_T, which is imbalanced, so that one color class has size at least (1/3 + ε)n for some constant ε > 0?
Let T_n(1,2) be the passage time between vertices 1 and 2 in the critical random graph model, and suppose the edge passage time has distribution t_eoversetd=p_cδ_0+(1-p_c)δ_1. Thus each edge has passage time 0 with probability p_c and 1…
It is an open problem whether LF2 is isomorphic to LF3 , where Fn is the free non- commutative group with n generators. ϕ(a1 b1 )ϕ(a2 b2 ) − ϕ(a1 a2 b1 b2 ) = (ϕ(a1 b1 ) − ϕ(a1 )ϕ(b1 )) (ϕ(a2 b2 ) − ϕ(a2 )ϕ(b2 ))
We conjecture that this should be the optimal behaviour of ϑs for k \geq 2, as well. Thus, the previous result naturally leads to the following Open problem. Find the sharp constant Ts,k in (1), i.e. determine the value of the following…
Let S be a finite ending string of heads and tails, let S' be its reversal, and let E(S) denote the expected number of fair-coin flips needed to produce S. Thus, if S=s_1s_2… s_r, then S'=s_rs_r-1… s_1. Reversal symmetry conjecture. If S'…
Is there an interesting enumerative problems for k-differentials in arbitrary genus g and profile A of zeros and poles? Does it have some relationship to the number Hgk (A)? 6. Enumerative Meaning and Future Directions A major open…
For each M≥1 and k≥0, let tilde p_M,k be the fraction of the first M records that break precisely k remaining records. Strong law conjecture. For every fixed k≥0, tilde p_M,koverseta.s.longrightarrow2^-(k+1) as M→∞. This is the pointwise…
S-curves with piecewise harmonic external field Consider the external potential φ(z)= -k_1 Re z, Re z>0, k_2 Re z, Re z0. Is there a continuum with the S-property connecting the points z_1=-ε_1+i and z_2=ε_2-i in the complex plane, for…
Obtain relaxation- and mixing-time bounds for reversible coagulation-fragmentation Markov chains on finite sets in terms of their model parameters.
Let X be a Hilbert modular surface over mathbbQ. All of the Tate classes that arise from modular curves on X are defined over mathbbQ^ab; however, there also exist Tate classes which are algebraic, but not defined over mathbbQ^ab. (In…
Let G be an infinite bounded-degree graph. Prove that I-dim(G)>1 implies p_c(G)<1. As a weaker target, prove the conclusion when I-dim(G)=∞.
(a) Given a map, take the two districts with the largest shared perimeter, then redraw to minimize boundary. Does this process eventually terminate in a simple, Voronoi-like partition (for instance, possibly, the partition minimizing cut…