Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Can we find G_1, G_2, G_3,… where lim_i→ ∞ |Z(G_1)|/|G_i| = 0 and Z(G_i) ≥ n/log(n).
Let G be an input graph with n vertices and m edges. An algorithm runs in the word RAM model with word size O(log n) bits. Triangle Detection Conjecture. There exists γ > 0 such that any algorithm to decide whether G is triangle-free…
Let k be a finitely generated field of characteristic p>0, let X be a smooth geometrically connected k-variety equipped with a GLP [?ρ and associated groups and covers Π_overline k and X_CΠ_overline k(n), and let ℓ≠ p. For a smooth proper…
There exists an absolute constant C such that for any convex body K, L_K ≤ C.
Prove or disprove each of the proposed implications between the SIRSN properties numbered (16), (20), (49), (50), and (51): (16)⇒(20), unique singly-infinite geodesics⇒(49), (49)⇒(50), and (51)⇒(50).
Let (X,B) be a log minimal model with dim(X)=4, and let C be a very general curve in X. Four-dimensional numerical non-vanishing conjecture. If (K+B)· C>0 for very general curves C⊂ X, then (K+B)^4>0. This condition is presented as…
Let G) be a simple assembly graph with n rigid vertices, each of degree 4, and let F_k denote the kth Fibonacci number. A Hamiltonian set of polygonal paths is a Hamiltonian set as defined for such assembly graphs. Tangled-cord extremal…
In the many-user regime for the Gaussian multiple-access channel, where the number of users grows proportionally to the code length, close the gap between the achievable-region (inner) and converse (outer) bounds by obtaining improved…
Let T(Y,overlineY,widetildeY) be a geometric transition satisfying a good condition, for example that its birational morphism φ contracts k exceptional divisors to a smooth curve of genus g>1 whose points are cA_k singularities.…
Let a graph be well-covered when all its maximal independent sets have the same cardinality; a maximum independent set is an independent set of cardinality α(G). The recognition complexity claim. It is NP-complete to recognize well-covered…
Let (X,p) be a reversible Markov chain. Write d:=max1/p(x,y):p(x,y)>0 for its sparsity constant, and let Lip denote the Lipschitz constant with respect to the combinatorial distance, also called the hop-count distance. Suppose that the…
Let G be a graph with N edges (e_i)_i=1,…,N and let ω be an open subset of G. The lengths of the edges are (ℓ_i)_i=1,…,N. Generic heat-control conjecture. Generically with respect to the lengths (ℓ_i)_i=1,…,N, the heat equation is…
An Adinkra is a colored graph encoding a one-dimensional supersymmetry representation, and its topology records the graph structure up to the relevant identifications. A topology is engineerable if it occurs for an Adinkra compatible with…
The space X^big and category MF(X^big,w) makes sense not just in type A. What is the analog of (X^big)^stable in other types? What is the categorical analog of the map Br_ext → Br_fin.
Does there exist an algorithm that, given two closed spraiges, decides whether they are admissibly equivalent?
Ellipses E_e of any eccentricity e are uniquely determined by their spectrum Sp(E_e).
Let X be a smooth k-variety. Let d4b3(X) be the category of perverse motives constructed by Ivorra, and let RL^ N_X:DA_ct(X)→D^b( N(X)) be the triangulated functor constructed by Ivorra. Betti-realization compatibility conjecture. The…
Let G be a graph and let k≥ 2. Denote by θ^3_k(G) the upper bound defined by the SDP relaxation in, and by θ'_k(G) the upper bound defined in. Comparison conjecture. The upper bound θ^3_k(G) is at least as good as the upper bound θ'_k(G).…
Let O be a nilpotent orbit of g, with representative f∈g satisfying dim(g^f∩h)=1, dim(g^f∩n_+)=1, and assume that the nonzero semisimple element of g^f∩h acts nontrivially on g^f∩n_+. Suppose also that the corresponding generator G^+…
Let X be a smooth Fano threefold, and let Nef_1(X)_ Z denote the integral points of the nef cone of curve classes. A good component is a component of the space of rational curves satisfying the paper's criteria for goodness. Eventual…