← All problems

The monotonicity conjecture for reducibility of nilpotent commuting varieties

13 years old · traced to

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.

Equivalent formulations
  1. Let Nn\mathcal{N}_n be the variety of nilpotent n×nn\times n matrices, and let Cr(Nn)C_r(\mathcal{N}_n) denote the variety of commuting rr-tuples in Nn\mathcal{N}_n. Monotonicity conjecture. If Cr(Nn)C_r(\mathcal{N}_n) is reducible, then so is Cr(Nn+1)C_r(\mathcal{N}_{n+1}). This would propagate known reducibility results from one matrix size to all larger sizes; the supplied text gives no resolution of the conjecture.

    source: Robert M. Guralnick and Nham V. Ngo, “Reducibility of nilpotent commuting varieties”, arXiv:1308.2420 (2013).

References
  1. Robert M. Guralnick and Nham V. Ngo, “Reducibility of nilpotent commuting varieties”, arXiv:1308.2420 (2013).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.