ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let J⊂([n]k)\mathcal{J}\subset {[n]\choose k} be an arrangement of largest minors, and let W∈([n]k)W\in {[n]\choose k}. Say that WW is (≥t,J)(\geq t,\mathcal{J})-largest if, for every arrangement of minors ending at J\mathcal{J}, it is absent from the final t−1t-1 arrangements. For a maximal arrangement J\mathcal{J} of largest minors and W∉JW\notin\mathcal{J}, let cubed(W,J)cube_d(W,\mathcal{J}) denote their cubical distance. Cubical-distance conjecture. If

cubed(W,J)=t,cube_d(W,\mathcal{J})=t,

then WW is (≥t+1,J)(\geq t+1,\mathcal{J})-largest minor. This conjecture predicts that cubical distance from a maximal arrangement controls how far below the largest minors an omitted minor lies. Its resolution is not indicated in the supplied text.

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.