Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Gelfand Models for D ...
Conference paper

Gelfand Models for Diagram Algebras

Tom Halverson (1)
(1) Department of Mathematics, Statistics, and Computer Science [Saint-Paul]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2012
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Proceedings
DOI
10.46298/dmtcs.2347
License
https://about.hal.science/hal-authorisation-v1
National Science Foundation
0800085
RUI: Combinatorics and Repesentations of Diagram Algebras
Indicators
652
Views
840
Downloads

Gelfand Models for Diagram Algebras

Tom Halverson (1)
(1) Department of Mathematics, Statistics, and Computer Science [Saint-Paul]
Abstract
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • multiplicity-free representation
  • symmetric group
  • partition algebra
  • Brauer algebra
  • Temperley-Lieb algebra
  • Motzkin algebra
  • rook-monoid
  • Gelfand model
Preview
Loading PDF preview...