Rank-condition conjecture for configuration varieties of diagrams
Statement
Let be a diagram whose columns are subsets of , and let be its configuration variety, consisting of configurations of subspaces with . For every list of columns of , impose the rank conditions
Rank-condition conjecture. For an arbitrary diagram , is the set of configurations satisfying these conditions for every list of columns of . Equivalently, the variety defined by these equations is irreducible.
The preceding proposition establishes this description for northwest diagrams. The conjecture asks for the analogous rank-condition description, and irreducibility, for arbitrary diagrams; the source gives no resolution.
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.