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

Simple item page
dc.creatorAssaf, Sami
dc.date2008-04-10
dc.date.accessioned2026-07-07T09:31:29Z
dc.date.available2026-07-07T09:31:29Z
dc.descriptionFor 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 explainthis 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.
dc.description9 pages, 6 figures To appear in DMTCS as part of the FPSAC 2008 conference proceedings
dc.identifierhttps://arxiv.org/abs/0804.1587
dc.identifierhttp://arxiv.org/abs/0804.1587
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158477
dc.subjectCombinatorics
dc.subjectRepresentation Theory
dc.subject05E10; 05E15; 20C30
dc.titleA combinatorial realization of Schur-Weyl duality via crystal graphs and dual equivalence graphs
dc.typetext

Files

Collections

arXiv