Remote Access Transactions of the American Mathematical Society
Green Open Access

Transactions of the American Mathematical Society

ISSN 1088-6850(online) ISSN 0002-9947(print)

 
 

 

A generalized Berele-Schensted algorithm and conjectured Young tableaux for intermediate symplectic groups


Author: Robert A. Proctor
Journal: Trans. Amer. Math. Soc. 324 (1991), 655-692
MSC: Primary 20G05; Secondary 05A15, 20C15
DOI: https://doi.org/10.1090/S0002-9947-1991-0989583-X
MathSciNet review: 989583
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: The Schensted and Berele algorithms combinatorially mimic the decompositions of $ { \otimes ^k}V$ with respect to $ {\operatorname{GL} _N}$ and $ {\operatorname{Sp} _{2n}}$. Here we present an algorithm which is a common generalization of these two algorithms. "Intermediate symplectic groups" $ {\operatorname{Sp} _{2n,m}}$ are defined. These groups interpolate between $ {\operatorname{GL} _N}$ and $ {\operatorname{Sp} _N}$. We conjecture that there is a decomposition of $ { \otimes ^k}V$ with respect to $ {\operatorname{Sp} _{2n,m}}$ which is described by the output of the new algorithm.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Transactions of the American Mathematical Society with MSC: 20G05, 05A15, 20C15

Retrieve articles in all journals with MSC: 20G05, 05A15, 20C15


Additional Information

DOI: https://doi.org/10.1090/S0002-9947-1991-0989583-X
Keywords: Schensted's algorithm, jeu d'tacquin, symplectic groups, tensor representations of Lie groups, Schur functions, group characters
Article copyright: © Copyright 1991 American Mathematical Society

American Mathematical Society