scholarly journals Gelfand Models for Diagram Algebras

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Tom Halverson

International audience 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.

10.37236/1619 ◽  
2001 ◽  
Vol 9 (1) ◽  
Author(s):  
Cheryl Grood

The wealth of beautiful combinatorics that arise in the representation theory of the symmetric group is well-known. In this paper, we analyze the representations of a related algebraic structure called the rook monoid from a combinatorial angle. In particular, we give a combinatorial construction of the irreducible representations of the rook monoid. Since the rook monoid contains the symmetric group, it is perhaps not surprising that the construction outlined in this paper is very similar to the classic combinatorial construction of the irreducible $S_n$-representations: namely, the Specht modules.


2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Nicholas Teff

International audience We combinatorially construct the complex cohomology (equivariant and ordinary) of a family of algebraic varieties called regular semisimple Hessenberg varieties. This construction is purely in terms of the Bruhat order on the symmetric group. From this a representation of the symmetric group on the cohomology is defined. This representation generalizes work of Procesi, Stembridge and Tymoczko. Here a partial answer to an open question of Tymoczko is provided in our two main result. The first states, when the variety has multiple connected components, this representation is made up by inducing through a parabolic subgroup of the symmetric group. Using this, our second result obtains, for a special family of varieties, an explicit formula for this representation via Young's rule, giving the multiplicity of the irreducible representations in terms of the classical Kostka numbers. Nous construisons la cohomologie complexe (équivariante et ordinaire) d'une famille de variétés algébriques appelées variétés régulières semisimples de Hessenberg. Cette construction utilise exclusivement l'ordre de Bruhat sur le groupe symétrique, et on en déduit une représentation du groupe symétrique sur la cohomologie. Cette représentation généralise des résultats de Procesi, Stembridge et Tymoczko. Nous offrons ici une réponse partielle à une question de Tymoczko grâce à nos deux résultats principaux. Le premier déclare que lorsque la variété a plusieurs composantes connexes, cette représentation s'obtient par induction à travers un sous-groupe parabolique du groupe symétrique. Nous en déduisons notre deuxième résultat qui fournit, pour une famille spéciale de variétés, une formule explicite pour cette représentation par la règle de Young, et donne ainsi la multiplicité des représentations irréductibles en termes des nombres classiques de Kostka.


10.37236/1881 ◽  
2005 ◽  
Vol 11 (2) ◽  
Author(s):  
Tom Halverson ◽  
Tim Lewandowski

We give combinatorial proofs of two identities from the representation theory of the partition algebra ${\Bbb C} A_k(n)$, $n \ge 2k$. The first is $n^k = \sum_\lambda f^\lambda m_k^\lambda$, where the sum is over partitions $\lambda$ of $n$, $f^\lambda$ is the number of standard tableaux of shape $\lambda$, and $m_k^\lambda$ is the number of "vacillating tableaux" of shape $\lambda$ and length $2k$. Our proof uses a combination of Robinson-Schensted-Knuth insertion and jeu de taquin. The second identity is $B(2k) = \sum_\lambda (m_k^\lambda)^2$, where $B(2k)$ is the number of set partitions of $\{1, \ldots, 2k\}$. We show that this insertion restricts to work for the diagram algebras which appear as subalgebras of the partition algebra: the Brauer, Temperley-Lieb, planar partition, rook monoid, planar rook monoid, and symmetric group algebras.


A new ‘most economical’ algorithm for the construction of diatomics in molecules secular equations is described. The method does not require the basis functions to be written down explicitly, since overlap may be factored out of the equations entirely. The theory is presented in detail for the particular case of homogeneous alkali metal clusters. A knowledge of the irreducible representations of the symmetric group for the Jahn-Serber basis set is necessary. The irreducible representations are derived by a genealogical procedure. Some preliminary calculations are presented for the molecules Li 3 through Li 6 , Li + 3 and Li + 4 . The lithium clusters are found to be stable with respect to all possible dissociations, and the i.ps of Li 3 and Li 4 are in agreement with the trends for the species Na 3 , Na 4 , K 3 , K 4 , etc., whose i.ps have been measured experimentally.


10.37236/1809 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Anthony Mendes ◽  
Jeffrey Remmel ◽  
Jennifer Wagner

A $\lambda$-ring version of a Frobenius characteristic for groups of the form $G \wr S_n$ is given. Our methods provide natural analogs of classic results in the representation theory of the symmetric group. Included is a method decompose the Kronecker product of two irreducible representations of $G\wr S_n$ into its irreducible components along with generalizations of the Murnaghan-Nakayama rule, the Hall inner product, and the reproducing kernel for $G\wr S_n$.


2019 ◽  
pp. 33-43
Author(s):  
Vasilii S. Duzhin ◽  
◽  
Anastasia A. Chudnovskaya ◽  

Search for Young diagrams with maximum dimensions or, equivalently, search for irreducible representations of the symmetric group $S(n)$ with maximum dimensions is an important problem of asymptotic combinatorics. In this paper, we propose algorithms that transform a Young diagram into another one of the same size but with a larger dimension. As a result of massive numerical experiments, the sequence of $10^6$ Young diagrams with large dimensions was constructed. Furthermore, the proposed algorithms do not change the first 1000 elements of this sequence. This may indicate that most of them have the maximum dimension. It has been found that the dimensions of all Young diagrams of the resulting sequence starting from the 75778th exceed the dimensions of corresponding diagrams of the greedy Plancherel sequence.


1973 ◽  
Vol 25 (5) ◽  
pp. 941-959 ◽  
Author(s):  
Y. J. Abramsky ◽  
H. A. Jahn ◽  
R. C. King

Frobenius [2; 3] introduced the symbolsto specify partitions and the corresponding irreducible representations of the symmetric group Ss.


1949 ◽  
Vol 1 (2) ◽  
pp. 166-175 ◽  
Author(s):  
G. de B. Robinson

The results of the present paper can be interpreted (a) in terms of the theory of the representations of the symmetric group, or (b) in terms of the corresponding theory of the full linear group. In the latter connection they give a solution to the problem of the expression of an invariant matrix of an invariant matrix as a sum of invariant matrices, in the sense of Schur's Dissertation. D. E. Littlewood has pointed out the significance of this problem for invariant theory and has attacked it via Schur functions, i.e. characters of the irreducible representations of the full linear group. We shall confine our attention here to the interpretation (a).


Sign in / Sign up

Export Citation Format

Share Document