Centralizer matrix algebras and symmetric polynomials of partitions (Q2168836): Difference between revisions
From MaRDI portal
Latest revision as of 23:25, 29 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Centralizer matrix algebras and symmetric polynomials of partitions |
scientific article |
Statements
Centralizer matrix algebras and symmetric polynomials of partitions (English)
0 references
26 August 2022
0 references
The main object under study, in this paper, is the centralizer algebra \[ S_n(C, k)=\{a\in \operatorname{M}_n(k)\colon ac=ca \ \forall c\in C \} \] of a non-empty set \(C\) of matrices in \(\operatorname{M}_n(k)\) over a field \(k\). Given an algebraically closed field \(K\), the authors show, in [\textit{C. Xi} and \textit{J. Zhang}, Linear Algebra Appl. 622, 215--249 (2021; Zbl 1473.16024)], that \(S_n(\{c\}, K)\) is a cellular algebra (in the sense of [\textit{J. J. Graham} and \textit{G. I. Lehrer}, Invent. Math. 123, No. 1, 1--34 (1996; Zbl 0853.20029)]) and the extension \(S_n({c}, K)\subset M_n(K)\) is a Frobenius extension. In this paper, the authors prove that a centralizer algebra \(S_n(\{c\}, k)\) of a matrix \(c\in M_n(k)\), over a field \(k\), is Frobenius-finite (in the sense of [\textit{W. Hu} and \textit{C. Xi}, Rev. Mat. Iberoam. 34, No. 1, 59--110 (2018; Zbl 1431.16012)]), \(1\)-minimal Auslander-Gorenstein (in the sense of [\textit{O. Iyama} and \textit{Ø. Solberg}, Adv. Math. 326, 200--240 (2018; Zbl 1432.16012)]), and gendo-symmetric (in the sense of [\textit{M. Fang} and \textit{S. Koenig}, Trans. Am. Math. Soc. 368, No. 7, 5037--5055 (2016; Zbl 1409.16006)]). Further, they prove that \(S_n(c, k)\subset M_n(k)\) is a separable Frobenius extension. Also, the authors give a characterisation for a centralizer algebra to be semi-simple over a field of positive characteristic in terms of the cycle type of the permutation. Over algebraically closed fields, the authors characterise when two semi-simple centraliser algebras of permutation matrices can be isomorphic and Morita equivalent in terms of combinatoric data of cycle types of the underlying permutations. The latter is reduced to the computation of the number of the distinct eigenvalues of the involved permutation matrices while the former is reduced to the study of an equivalence relation in the set of partitions of a natural number \(n\).
0 references
centralizer algebras
0 references
Frobenius extension
0 references
Gorenstein algebra
0 references
greatest common divisor
0 references
invariant matrix algebra
0 references
partition
0 references
symmetric polynomial
0 references
0 references
0 references