2000 character limit reached
On varieties of commuting nilpotent matrices
Published 20 Aug 2013 in math.AG | (1308.4438v2)
Abstract: Let $N(d,n)$ be the variety of all $d$-tuples of commuting nilpotent $n\times n$ matrices. It is well-known that $N(d,n)$ is irreducible if $d=2$, if $n\le 3$ or if $d=3$ and $n=4$. On the other hand $N(3,n)$ is known to be reducible for $n\ge 13$. We study in this paper the reducibility of $N(d,n)$ for various values of $d$ and $n$. In particular, we prove that $N(d,n)$ is reducible for all $d,n\ge 4$. In the case $d=3$, we show that it is irreducible for $n\le 6$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.