Invariant algebras of matrices and symmetric polynomials of partitions

Abstract

For a field R of characteristic p 0 and a matrix c in the full n× n matrix algebra Mn(R) over R, let Sn(c,R) be the centralizer algebra of c in Mn(R). We show that Sn(c,R) is a Frobenius-finite, 1-Auslander-Gorenstein, and gendo-symmetric algebra, and that the extension Sn(c,R)⊂eq Mn(R) is separable and Frobenius. Further, we study the isomorphism problem of invariant matrix algebras. Let σ be a permutation in the symmetric group n and cσ the corresponding permutation matrix in Mn(R). We give sufficient and necessary conditions for the invariant algebra Sn(cσ,R) to be semisimple. If R is an algebraically closed field, we establish a combinatoric characterization of when two semisimple invariant R-algebras are isomorphic in terms of the cycle types of permutations.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…