2000 character limit reached
On normal forms for the similarity classes of matrices and pairs of matrices (2502.10926v1)
Published 15 Feb 2025 in math.RT
Abstract: We answer two questions posed 1998 in the book 'Arnolds problems'. First, over any field k there is a representative system for the similarity classes of nxn-matrices which is a finite disjoint union of affine subspaces. And second, for n>1 an analogous statement fails for pairs of nxn-matrices over any algebraically closed field of characteristic 0.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.