ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For n≥1n \geq 1, let D(n,n)D(n,n) be the set of minor specifications described in the paper, and let M(S)M(S) be the associated product of minors of a positive n×nn \times n matrix AA. Let xx be the top-left entry of Sink⁡(A)\operatorname{Sink}(A). Square-matrix polynomial conjecture. There exist integers cS(n)c_S(n), indexed by subsets S⊆D(n,n)S \subseteq D(n,n), such that

∑S⊆D(n,n)cS(n)M(S)x∣S∣=0.\sum_{S \subseteq D(n,n)} c_S(n)M(S)x^{|S|}=0.

Equivalently, the coefficient of xkx^k is a linear combination of the M(S)M(S) with ∣S∣=k|S|=k, and the equation has degree at most (2n−2n−1)\binom{2n-2}{n-1}. The claim is inferred from the proven 3×33 \times 3 case and interpolation for 4×44 \times 4 matrices; it remains open in general.

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.