Gelfand-Graev characters and their degenerate counter parts have an important role in there presentation theory of finite groups of Lie type. Using a characteristic map to translate the character theory of the finite unitary groups into the language of symmetric functions, we study degenerate Gelfand-Graev characters of the finite unitary group from a combinatorial point of view. In particular, we give the values of Gelfand-Graev characters at arbitrary elements, recover the decomposition multiplicities of degenerate Gelfand-Graev characters in terms of tableau combinatorics, and conclude with some multiplicity consequence
AbstractYoung tableaux and Gelfand patterns which combinatorially describe characters of irreducible...
Young tableaux and Gelfand patterns which combinatorially describe characters of irreducible finite ...
We study the combinatorial structure of the irreducible characters of the classical groups ${\rm GL}...
AbstractIn his classic book on symmetric functions, Macdonald describes a remarkable result by Green...
International audienceIntroduced by Kawanaka in order to find the unipotent representations of finit...
Introduced by Kawanaka in order to find the unipotent representations of finite groups of Lie type, ...
Introduced by Kawanaka in order to find the unipotent representations of finite groups of Lie type, ...
AbstractIn his classic book on symmetric functions, Macdonald describes a remarkable result by Green...
Original manuscript December 14, 2011The Gelfand–Tsetlin graph is an infinite graded graph that enco...
Abstract. With a view to determining character values of finite reductive groups at unipotent elemen...
With a view to determining character values of finite reductive groups at unipotent elements, we pro...
A block character of a finite symmetric group is a positive definite function which depends only on ...
We study the combinatorial structure of the irreducible characters of the classical groups GLn(C), S...
AbstractYoung tableaux and Gelfand patterns which combinatorially describe characters of irreducible...
Young tableaux and Gelfand patterns which combinatorially describe characters of irreducible finite ...
AbstractYoung tableaux and Gelfand patterns which combinatorially describe characters of irreducible...
Young tableaux and Gelfand patterns which combinatorially describe characters of irreducible finite ...
We study the combinatorial structure of the irreducible characters of the classical groups ${\rm GL}...
AbstractIn his classic book on symmetric functions, Macdonald describes a remarkable result by Green...
International audienceIntroduced by Kawanaka in order to find the unipotent representations of finit...
Introduced by Kawanaka in order to find the unipotent representations of finite groups of Lie type, ...
Introduced by Kawanaka in order to find the unipotent representations of finite groups of Lie type, ...
AbstractIn his classic book on symmetric functions, Macdonald describes a remarkable result by Green...
Original manuscript December 14, 2011The Gelfand–Tsetlin graph is an infinite graded graph that enco...
Abstract. With a view to determining character values of finite reductive groups at unipotent elemen...
With a view to determining character values of finite reductive groups at unipotent elements, we pro...
A block character of a finite symmetric group is a positive definite function which depends only on ...
We study the combinatorial structure of the irreducible characters of the classical groups GLn(C), S...
AbstractYoung tableaux and Gelfand patterns which combinatorially describe characters of irreducible...
Young tableaux and Gelfand patterns which combinatorially describe characters of irreducible finite ...
AbstractYoung tableaux and Gelfand patterns which combinatorially describe characters of irreducible...
Young tableaux and Gelfand patterns which combinatorially describe characters of irreducible finite ...
We study the combinatorial structure of the irreducible characters of the classical groups ${\rm GL}...