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

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

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

Full description

Bibliographic Details
Main Author:	S. Assaf
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2008-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	schur-weyl duality zero weight spaces crystal graphs dual equivalence graphs [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/3626/pdf

Similar Items

Colouring random geometric graphs
by: Colin J. H. McDiarmid, et al.
Published: (2005-01-01)

Distance graphs with maximum chromatic number
by: Javier Barajas, et al.
Published: (2005-01-01)

Brauer-Schur functions
by: Kazuya Aokage
Published: (2009-01-01)

An upper bound for the chromatic number of line graphs
by: Andrew D. King, et al.
Published: (2005-01-01)

Fast separation in a graph with an excluded minor
by: Bruce Reed, et al.
Published: (2005-01-01)

On the $L(p,1)$-labelling of graphs
by: Daniel Gonçalves
Published: (2005-01-01)

Quasisymmetric (k,l)-hook Schur functions
by: Sarah Mason, et al.
Published: (2014-01-01)

Largest cliques in connected supermagic graphs
by: Anna Lladó
Published: (2005-01-01)

(k − 2)-linear connected components in hypergraphs of rank k
by: Florian Galliot, et al.
Published: (2023-11-01)

On Kerov polynomials for Jack characters (extended abstract)
by: Valentin Féray, et al.
Published: (2013-01-01)

Row-strict quasisymmetric Schur functions
by: Sarah K Mason, et al.
Published: (2011-01-01)

Nonrepetitive colorings of graphs
by: Noga Alon, et al.
Published: (2005-01-01)

Kerov's central limit theorem for Schur-Weyl and Gelfand measures (extended abstract)
by: Pierre-Loïc Méliot
Published: (2011-01-01)

Graph Orientations and Linear Extensions.
by: Benjamin Iriarte
Published: (2014-01-01)

$K_{\ell}^{-}$-factors in graphs
by: Daniela Kühn, et al.
Published: (2005-01-01)

Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable
by: Marthe Bonamy, et al.
Published: (2016-05-01)

Staircase Macdonald polynomials and the $q$-Discriminant
by: Adrien Boussicault, et al.
Published: (2008-01-01)

Balanced Avoidance Games on Random Graphs
by: Martin Marciniszyn, et al.
Published: (2005-01-01)

A Probabilistic Counting Lemma for Complete Graphs
by: Stefanie Gerke, et al.
Published: (2005-01-01)

A characterization of extremal graphs with no matching-cut
by: Paul Bonsma
Published: (2005-01-01)

A Littlewood-Richardson type rule for row-strict quasisymmetric Schur functions
by: Jeffrey Ferreira
Published: (2011-01-01)

Blocks in Constrained Random Graphs with Fixed Average Degree
by: Konstantinos Panagiotou
Published: (2009-01-01)

Degree distribution in random planar graphs
by: Michael Drmota, et al.
Published: (2008-01-01)

Application of graph combinatorics to rational identities of type $A^\ast$
by: Adrien Boussicault, et al.
Published: (2009-01-01)

Equivalent Subgraphs of Order $3$
by: Tomoki Nakamigawa
Published: (2005-01-01)

Quasisymmetric Schur functions
by: James Haglund, et al.
Published: (2008-01-01)

Mader Tools
by: Frank Göring
Published: (2005-01-01)

A product formula for the TASEP on a ring
by: Erik Aas, et al.
Published: (2014-01-01)

Noncommutative Symmetric Hall-Littlewood Polynomials
by: Lenny Tevlin
Published: (2011-01-01)

Packing Three-Vertex Paths in a Subcubic Graph
by: Adrian Kosowski, et al.
Published: (2005-01-01)

Relaxed Two-Coloring of Cubic Graphs
by: Robert Berke, et al.
Published: (2005-01-01)

Deformations of Weyl's Denominator Formula
by: Angêle Hamel, et al.
Published: (2014-01-01)

Honeycombs from Hermitian Matrix Pairs
by: Glenn Appleby, et al.
Published: (2014-01-01)

The Windy Postman Problem on Series-Parallel Graphs
by: Francisco Javier Zaragoza Martínez
Published: (2005-01-01)

Density of universal classes of series-parallel graphs
by: Jaroslav Nešetřil, et al.
Published: (2005-01-01)

Noncommutative symmetric functions III : Deformations of Cauchy and convolution algebras
by: Gérard Duchamp, et al.
Published: (1997-01-01)

Combinatorial properties of permutation tableaux
by: Alexander Burstein, et al.
Published: (2008-01-01)

An Edge-Signed Generalization of Chordal Graphs, Free Multiplicities on Braid Arrangements, and Their Characterizations
by: Takuro Abe, et al.
Published: (2009-01-01)

Cyclic sieving for two families of non-crossing graphs
by: Svetlana Poznanović
Published: (2011-01-01)

Hamiltonian Chains in Hypergraphs
by: Gyula Y. Katona
Published: (2005-01-01)