ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Id(d,2d−1)I_d(d,2d-1) be the ideal generated by the maximal permanents of the generic d×(2d−1)d\times(2d-1) matrix Md,2d−1M_{d,2d-1} over a field kk. Monomial conjecture for maximal permanents. If char⁡k>d\operatorname{char} k>d or char⁡k=0\operatorname{char} k=0, every minimal prime over Id(d,2d−1)I_d(d,2d-1) either contains a column of Md,2d−1M_{d,2d-1} or contains the (d−1)×(d−1)(d-1)\times(d-1) permanents of some set of d−1d-1 rows. If char⁡k≤d\operatorname{char} k\leq d, a minimal prime may, in addition, contain the d×dd\times d minors of Md,2d−1M_{d,2d-1}. The text says this conjecture is proved for d=3d=3, while the general case is presented as less understood.

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.