Matrices connected with Brauer's centralizer algebras (Q1909964)

From MaRDI portal





scientific article; zbMATH DE number 861583
Language Label Description Also known as
English
Matrices connected with Brauer's centralizer algebras
scientific article; zbMATH DE number 861583

    Statements

    Matrices connected with Brauer's centralizer algebras (English)
    0 references
    0 references
    21 July 1996
    0 references
    Summary: In a 1989 paper, Hanlon and Wales showed that the algebra structure of the Brauer centralizer algebra \(A_f^{(x)}\) is completely determined by the ranks of certain combinatorially defined square matrices \(Z^{\lambda/\mu}\), whose entries are polynomials in the parameter \(x\). We consider a set of matrices \(M^{\lambda/\mu}\) found by Jockusch that have a similar combinatorial description. These new matrices can be obtained from the original matrices by extracting the terms that are of ``highest degree'' in a certain sense. Furthermore, the \(M^{\lambda/\mu}\) have analogues \({\mathcal M}^{\lambda/\mu}\) that play the same role that the \(Z^{\lambda/\mu}\) play in \(A_f^{(x)}\), for another algebra that arises naturally in this context. We find very simple formulas for the determinants of the matrices \(M^{\lambda/\mu}\) and \({\mathcal M}^{\lambda/\mu}\), which prove Jockusch's original conjecture that \(\text{det }M^{\lambda/\mu}\) has only integer roots. We define a Jeu de Taquin algorithm for standard matchings, and compare this algorithm to the usual Jeu de Taquin algorithm defined by Schützenberger for standard tableaux. The formulas for the determinants of \(M^{\lambda/\mu}\) and \({\mathcal M}^{\lambda/\mu}\) have elegant statements in terms of this new Jeu de Taquin algorithm.
    0 references
    Brauer centralizer algebras
    0 references
    determinants
    0 references
    integer roots
    0 references
    Jeu de Taquin algorithm
    0 references
    standard matchings
    0 references
    standard tableaux
    0 references

    Identifiers