Tom Halverson - Gelfand Models for Diagram Algebras

dmtcs:2347 - Discrete Mathematics & Theoretical Computer Science, January 1, 2013, DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013) - https://doi.org/10.46298/dmtcs.2347
Gelfand Models for Diagram AlgebrasArticle

Authors: Tom Halverson 1

  • 1 Department of Mathematics, Statistics, and Computer Science [Saint-Paul]

A Gelfand model for a semisimple algebra $\mathsf{A}$ over $\mathbb{C}$ is a complex linear representation that contains each irreducible representation of $\mathsf{A}$ with multiplicity exactly one. We give a method of constructing these models that works uniformly for a large class of combinatorial diagram algebras including: the partition, Brauer, rook monoid, rook-Brauer, Temperley-Lieb, Motzkin, and planar rook monoid algebras. In each case, the model representation is given by diagrams acting via ``signed conjugation" on the linear span of their vertically symmetric diagrams. This representation is a generalization of the Saxl model for the symmetric group, and, in fact, our method is to use the Jones basic construction to lift the Saxl model from the symmetric group to each diagram algebra. In the case of the planar diagram algebras, our construction exactly produces the irreducible representations of the algebra.


Volume: DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Section: Proceedings
Published on: January 1, 2013
Imported on: November 21, 2016
Keywords: Gelfand model,multiplicity-free representation,symmetric group,partition algebra,Brauer algebra,Temperley-Lieb algebra,Motzkin algebra,rook-monoid,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Funding:
    Source : OpenAIRE Graph
  • RUI: Combinatorics and Repesentations of Diagram Algebras; Funder: National Science Foundation; Code: 0800085

Consultation statistics

This page has been seen 197 times.
This article's PDF has been downloaded 302 times.