Genericity conjecture for dope matrices
Statement
Let be a polynomial, let be an -tuple of distinct complex numbers, and let denote the associated dope matrix. For generic , write for the set of such matrices.
Genericity conjecture. For , consists exactly of the -matrices such that, for every , there are at most nonzero entries in the last columns.
The condition is known to be sufficient when and, by the paper's theorem, when . Computations for and support the conjecture, but the general case remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.