A combinatorial realization of Schur-Weyl duality via crystal graphs and dual equivalence graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2008

A combinatorial realization of Schur-Weyl duality via crystal graphs and dual equivalence graphs

Abstract

For any polynomial representation of the special linear group, the nodes of the corresponding crystal may be indexed by semi-standard Young tableaux. Under certain conditions, the standard Young tableaux occur, and do so with weight $0$. Standard Young tableaux also parametrize the vertices of dual equivalence graphs. Motivated by the underlying representation theory, in this paper, we explain this connection by giving a combinatorial manifestation of Schur-Weyl duality. In particular, we put a dual equivalence graph structure on the $0$-weight space of certain crystal graphs, producing edges combinatorially from the crystal edges. The construction can be expressed in terms of the local characterizations given by Stembridge for crystal graphs and the author for dual equivalence graphs.
Fichier principal
Vignette du fichier
dmAJ0113.pdf (122.04 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01185161 , version 1 (19-08-2015)

Identifiers

Cite

S. Assaf. A combinatorial realization of Schur-Weyl duality via crystal graphs and dual equivalence graphs. 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), 2008, Viña del Mar, Chile. pp.141-152, ⟨10.46298/dmtcs.3626⟩. ⟨hal-01185161⟩

Collections

INSMI TDS-MACS
50 View
540 Download

Altmetric

Share

Gmail Facebook X LinkedIn More