ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a diagram whose columns are subsets of 1,…,N\\{1,\ldots,N\\}, and let FD\mathcal F_D be its configuration variety, consisting of configurations (VC)C∈D(V_C)_{C\in D} of subspaces with dim⁡VC=∣C∣\dim V_C=|C|. For every list of columns C,C′,…C,C',\ldots of DD, impose the rank conditions

dim⁡(VC+VC′+⋯ )≤∣C∪C′∪⋯∣,\dim(V_C+V_{C'}+\cdots)\leq |C\cup C'\cup\cdots|, dim⁡(VC∩VC′∩⋯ )≥∣C∩C′∩⋯∣.\dim(V_C\cap V_{C'}\cap\cdots)\geq |C\cap C'\cap\cdots|.

Rank-condition conjecture. For an arbitrary diagram DD, FD\mathcal F_D is the set of configurations satisfying these conditions for every list of columns C,C′,…C,C',\ldots of DD. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.