Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Set-partition tableaux and representations of diagram algebras (1808.08118v2)

Published 24 Aug 2018 in math.RT and math.CO

Abstract: The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition, rook monoid, rook-Brauer, Temperley-Lieb, Motzkin, planar rook monoid, and symmetric group algebras. We give a construction of the irreducible modules of these algebras in two isomorphic ways: first, as the span of symmetric diagrams on which the algebra acts by conjugation twisted with an irreducible symmetric group representation and, second, on a basis indexed by set-partition tableaux such that diagrams in the algebra act combinatorially on tableaux. The first representation is analogous to the Gelfand model and the second is a generalization of Young's natural representation of the symmetric group on standard tableaux. The methods of this paper work uniformly for the partition algebra and its diagram subalgebras. As an application, we express the characters of each of these algebras as nonnegative integer combinations of symmetric group characters whose coefficients count fixed points under conjugation.

Summary

We haven't generated a summary for this paper yet.