Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let G be a graph, and let rm gp_→(G) denote the minimum general position number over all orientations of G. The lower-number-two hardness conjecture. It is NP-hard to decide whether rm gp_→(G)=2. The supplied text does not provide a proof…
Consider the decision problem sc Trail Trap rm P2-win: given a graph, determine whether the second player has a winning strategy in Trail Trap. Trail Trap PSPACE-completeness conjecture. The problem sc Trail Trap rm P2-win is…
Let A and B be non-bipartite loopless undirected graphs such that A→B. The Brakensiek–Guruswami conjecture asserts that PCSP(A,B) is NP-hard. Here PCSP(A,B) is the approximate graph homomorphism problem distinguishing instances homomorphic…
Let M be a closed 3-manifold, and let τ_1 and τ_2 be triangulations of M. A mutual refinement is a triangulation refining both τ_1 and τ_2. ER mutual-refinement conjecture. Any two triangulations of M have an ER mutual refinement. The…
Let L be the class of binary constraint system games, and let SAT_matrix(L) and SAT_R^U(L) denote the corresponding satisfiability problems for finite-dimensional matrix strategies and universal tracial strategies, respectively. The…
A constraint satisfaction or optimization problem is a computational problem whose feasible assignments or candidate solutions can be evaluated by its constraints or objective function. A dynamical system is a system with an invariant…
Let (X,T) be an efficiently discretizable topological dynamical system. Recall that a system is transitive when it has the stated topological transitivity property, and topologically mixing when it has the corresponding mixing property.…
For a tournament T and a positive integer k, the problem k-Inversion asks whether T can be made acyclic using at most, or equivalently in the paper's formulation exactly, k inversions; the source states the resulting complexity claim in…
For every graph H, consider the problem textscH-Cover of deciding whether an input graph covers H. Strong Dichotomy Conjecture. For every graph H, the problem textscH-Cover is either polynomial-time solvable for arbitrary input graphs, or…
Let S⊆ [n]×[n]. Define the decision problem CONVEX to output TRUE if the projection π_S(SO(n)) is convex, and FALSE otherwise. NP-hardness conjecture. The problem CONVEX is NP-hard. This conjecture concerns the computational complexity of…
For a nonnegative matrix M, its nonnegative rank rank_+(M) is the least inner dimension of a factorization of M into two nonnegative matrices. The ordinary rank rank(M) is the usual matrix rank. Fixed-rank NP-hardness conjecture. Computing…
Let F_r be a free group, and let w∈ F_r be a word whose length cannot be reduced by any elementary Whitehead automorphism; in particular, w is cyclically reduced. Consider the elements in the automorphic orbit of w having the same length…
Let P = x∈ R^ncolon Ax≤ b be a polytope defined by a matrix A∈ Q^m× n and a vector b∈ Q^m, let s and t be vertices of P, and let k∈ Z_≥ 0. A circuit walk is a walk from s to t whose steps follow circuit directions of P. The conjectured…
Let L be an atomistic lattice with maximum element 1 and set of atoms A(L). For a subset H⊆ A(L), write bigvee H for its join. Atomistic-lattice hull-number conjecture. The minimum size of a subset H⊆ A(L) such that bigvee H=1 can be…
Let p,q be positive integers with p≥ 1 and q≥ 2, and let i≤ p and j≤ q. Let Ψ be a family of graphs for which recognizing generating subgraphs isomorphic to K_i,j is NP-complete. Monotonicity conjecture. Then recognizing generating…
A graph G has a mutual-visibility coloring if its vertices can be colored so that the required mutual-visibility condition holds; the associated decision problem asks whether G admits such a coloring with a prescribed number of colors.…
Let d≥ 2 and let C⊆ 2^[n] be a code. A pseudo-monomial is an element of the canonical form CF(J_ C) of the neural ideal J_ C, and its degree is the number of factors in the pseudo-monomial. Efficient degree computation conjecture. There is…
For a finite set of permutation patterns F, let C_n(F) denote the number of permutations in S_n avoiding all patterns in F. Parity problem. The problem of deciding whether C_n(F)≡ 0pmod 2 for every n∈ N is undecidable. The authors present…
Let C be a natural complexity class, let h(L_n) denote the homological complexity of the restriction L_n of a problem L to inputs of size n, and let f_C:N→N. Precise homological complexity characterization. For every natural complexity…
Consider the decision problem Pirates and Treasure, whose input is a graph G and whose outcome is determined by the game's scoring-play rules. PSpace-completeness conjecture. Pirates and Treasure is PSpace-complete. The problem is stated…