| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9652874 | Journal of Symbolic Computation | 2005 | 25 Pages |
Abstract
We present two proofs of our main theorems: one uses the results of Enright and Shelton on classical Hermitian pairs, and the other is independent of their work. The latter proof mixes classical (and briefly reviewed) facts of representation theory with combinatorial and computational arguments, and is accessible to readers unfamiliar with the vast modern literature on category O.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Jan Draisma,