24 problems
Common-complexity conjecture. The complexity of for patterns , , and is the same. Its common value is the inverse of the modulus of the smaller root of
Valiant's conjecture. Valiant's conjecture for is
Let be the underlying field, and let be a tensor that is tight and concise. Here, concise means that the flatt…
Let be an matrix of indeterminates, and let be the ideal generated by the minors of . For a nonzero polynomial ,…
Let and denote the homological complexities associated with the permanent and determinant, respectively, and let …
Average class size conjecture (weak version (b)). The limiting ratio satisfies
Circle generator complexity conjecture (strong version). The average circle generator complexity of class algebras is smaller than the corresponding average for fusion algebras:
Let be the underlying field, and consider concise tensors in … Write for the worst-case exponent of this space. Extended asymptotic rank conjecture. For al…
Let be the base field, let , and let be an configuration. Write for its -linear span. Strong radical Sylvester–Gallai conjecture. T…
Let be the base field. For , an configuration is a configuration of polynomials as defined in the cited formulation of Gupta's conjecture; its transce…
Factor Conjecture. One has
For a polynomial , let denote the least size of a matrix of affine linear forms whose determinant equals . Let denote the permanent of an…
Let be the class of polynomial families computable by polynomial-size algebraic branching programs, and let be Valiant's class of polynomially verifia…
Let be an algorithm of length computing the matrix multiplication tensor . Its automorphism group is denoted by . Let…
Strassen's support-functional conjecture. The asymptotic spectrum of the class of tight tensors coincides with the set of support functionals .
Let denote the permutation group on elements, let be linear coordinates on , and define the permanent by … A polynomial-size circuit is…
Constructed-family determinantal lower-bound conjecture. If is small enough, then, with high probability, cannot be expressed as a symbolic determinant of size at most…
Let \textup{\textsf{VPs}} denote the class of polynomial-size algebraic circuits with bounded degree, and let denote Valiant's class of efficiently defi…
Symmetric Strassen additivity conjecture.
Let be the ideal of the join of the relevant secant variety and coordinate linear space . A generator is called we…
Fix and . Set and . The notation denotes the relevant matrix rigidity variety, and its irreducib…
Let or , and let when and when…
Mulmuley–Sohoni's strengthened conjecture. For each and infinitely many , . This is a central geometric-complexity-…
Let be a field of characteristic , and let strictly upper-bound the rank of any minimal and simple …