77 problems
Leading-block and eigenvalue conjecture. This leading principal diagonal block of is a -matrix. Moreover, has exactly one negative eigenvalue.
Let be a number field, let , and suppose that the triangularization variety has a rational point, . An irreducibl…
The Fooling-Set-Submatrix problem takes integers and an -matrix as input, and asks whether contains a fooling-set submatrix of size . NP-hardness…
Let , let , and let an sign pattern require when … A sign pattern is irreducible i…
Quadratic bound conjecture. There is a constant such that every such set has a product of length smaller than with positive entries.
Let and be two hypomorphic matrices, meaning that for a hypomorphism as in the surrounding reconstruction setting. Let be a simple eigenv…
Let be the permutation group on letters and let denote the group of diagonal sign matrices. Twisted-product refinement. The group in the spectral r…
Let be a real symmetric matrix. For each , write for the matrix obtained by deleting the th row and column, and let denote th…
The Asymptotic Lower -Permanent Conjecture. Under these hypotheses,
Extended local-permutation conjecture. Every element of is similar to a block-shift matrix via an element of .
Determinant and inverse conjecture. One has
Bernoulli-moment characterization conjecture. There is a family of functions such that a matrix is a distinguished matrix of a si…
Cecotti–Vafa spectrum conjecture. The Cecotti–Vafa construction can be made precise so that
Let and let be a field. Let be an affine subspace of such that every element of is nilpotent, and assume that each element of…
Let be a strictly upper triangular -matrix, meaning that its entries are or , and suppose that for each there is at most one pair with a…
Let be a positive integer. A braid projection is a braid diagram without over/under-crossing information. Its CN matrix is the zero-diagonal matrix whose entry c…
Let be a positive integer. For an -braid diagram, its OU matrix is the non-negative integer zero-diagonal matrix whose entry counts crossings between strands…
Let be a positive integer, and let be an integer matrix. A zero-diagonal matrix is T0 if, whenever , the conditions imply…
Characterization conjecture. An matrix is the crossing matrix of some positive pure braid if and only if is a non-negative integer T0 symmetric matrix.
Ryser's conjecture. The permanent of is maximal in .
Let be the matrix displayed in the paper, and let be any vertex multiplication of . Vertex-multiplication conjecture. One should have … This conjec…
Singularity conjecture. The matrix is singular if and only if
Multiplicity-matrix conjecture. The matrix is upper triangular. Furthermore, if is nonzero, then and . This…
Let be a non-empty finite set, and let denote the quantity counting the relevant commuting pairs of matrices associated…
Let be the additive group of matrices over . For integers with , let…