AbstractYoung tableaux and Gelfand patterns which combinatorially describe characters of irreducible finite dimensional representations of complex classical Lie groups are presented. Some branching rules and/or character recursions are given explicit combinatorial descriptions. These recursions are derived from manipulations of determinantal character formulas
We study the combinatorial structure of the irreducible characters of the classical groups ${\rm GL}...
The combinatorics of reduced words and their commutation classes plays an important role in geometri...
AbstractIn this paper, we continue the development of a new combinatorial model for the irreducible ...
Young tableaux and Gelfand patterns which combinatorially describe characters of irreducible finite ...
Young tableaux and Gelfand patterns which combinatorially describe characters of irreducible finite ...
AbstractYoung tableaux and Gelfand patterns which combinatorially describe characters of irreducible...
Just as the definition of factorial Schur functions as a ratio of determinants allows one to show th...
AbstractIn this paper, we continue the development of a new combinatorial model for the irreducible ...
Abstract. In this paper, we continue the development of a new combinatorial model for the irreducibl...
The problem of studying special bases in irreducible representations of Lie groups has already attra...
Gelfand-Graev characters and their degenerate counter parts have an important role in there presenta...
We construct functors categorifying the branching rules for Uq() for of type Bn, Cn, and Dn for the...
We study the combinatorial structure of the irreducible characters of the classical groups GLn(C), S...
AbstractWe present a set of axioms for combinatorial objects closely related to those for Kashiwara'...
AbstractThe method of Young diagrams for the symmetric groups is reformulated with special emphasis ...
We study the combinatorial structure of the irreducible characters of the classical groups ${\rm GL}...
The combinatorics of reduced words and their commutation classes plays an important role in geometri...
AbstractIn this paper, we continue the development of a new combinatorial model for the irreducible ...
Young tableaux and Gelfand patterns which combinatorially describe characters of irreducible finite ...
Young tableaux and Gelfand patterns which combinatorially describe characters of irreducible finite ...
AbstractYoung tableaux and Gelfand patterns which combinatorially describe characters of irreducible...
Just as the definition of factorial Schur functions as a ratio of determinants allows one to show th...
AbstractIn this paper, we continue the development of a new combinatorial model for the irreducible ...
Abstract. In this paper, we continue the development of a new combinatorial model for the irreducibl...
The problem of studying special bases in irreducible representations of Lie groups has already attra...
Gelfand-Graev characters and their degenerate counter parts have an important role in there presenta...
We construct functors categorifying the branching rules for Uq() for of type Bn, Cn, and Dn for the...
We study the combinatorial structure of the irreducible characters of the classical groups GLn(C), S...
AbstractWe present a set of axioms for combinatorial objects closely related to those for Kashiwara'...
AbstractThe method of Young diagrams for the symmetric groups is reformulated with special emphasis ...
We study the combinatorial structure of the irreducible characters of the classical groups ${\rm GL}...
The combinatorics of reduced words and their commutation classes plays an important role in geometri...
AbstractIn this paper, we continue the development of a new combinatorial model for the irreducible ...
DOI
Add to ORKG