ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Λ\Lambda be the set of integer sequences λ1≥⋯≥λn−1≥λn=0\lambda_1\geq\cdots\geq\lambda_{n-1}\geq\lambda_n=0 satisfying λi≤n−i\lambda_i\leq n-i for all ii. For each λ∈Λ\lambda\in\Lambda, define

ai=n−i−λi,bi=#{i<j:λi−λj+i−j∈{0,1}},a_i=n-i-\lambda_i,\qquad b_i=\#\{i<j:\lambda_i-\lambda_j+i-j\in\{0,1\}\},

and set

D(λ)={(ai,bi)∣1≤i≤n}.D(\lambda)=\{(a_i,b_i)\mid 1\leq i\leq n\}.

Let Δ(D(λ))\Delta(D(\lambda)) denote the associated determinant polynomial. The minimal generating-set conjecture. The set

G={Δ(D(λ))}λ∈ΛG=\{\Delta(D(\lambda))\}_{\lambda\in\Lambda}

generates II. The conjecture proposes an explicit combinatorial generating set for the radical ideal defining the diagonal locus of (C2)n(\mathbb{C}^2)^n; the supplied text gives no resolution evidence, so its status 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 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.