ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be an algebraically closed field, and let Nn\mathcal{N}_n be the variety of nilpotent n×nn\times n matrices. For r≥2r\ge 2, let Cr(Nn)C_r(\mathcal{N}_n) be the variety of pairwise commuting rr-tuples of elements of Nn\mathcal{N}_n.

Monotonicity conjecture. If Cr(Nn)C_r(\mathcal{N}_n) is reducible, then Cr(Nn+1)C_r(\mathcal{N}_{n+1}) is reducible.

If true, this would propagate known reducibility in matrix size nn to every larger matrix size. The source presents the assertion under “Open problems” and gives no proof.

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.