๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Structure of the Young Symmetrizers for Spin Representations of the Symmetric Group, II

โœ Scribed by Andrew R Jones


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
156 KB
Volume
213
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

โœฆ Synopsis


The first paper in this series established that the projective analogue of the Young symmetrizer recently introduced by Nazarov has a natural PxQ-structure comparable with the pq-form of the classical symmetrizer. This second paper develops the theory on this decomposition further. A more efficient construction of the projective symmetrizer is presented for certain classes of partitions; this approach yields a ''compact'' expression for the intermediate factor x in the projective decomposition.


๐Ÿ“œ SIMILAR VOLUMES


The Structure of the Young Symmetrizers
โœ Andrew R. Jones ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 355 KB

This paper is the first in a series of three papers on the Young symmetrizers for the spin representations of the symmetric group. In this opening paper, it is shown that the projective analogue of the Young symmetrizer recently introduced by Nazarov has a structure resembling the p ฮป q ฮป -form exhi

Characters of two-row representations of
โœ Brian G. Wybourne; Norbert Flocke; Jacek Karwowski ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 124 KB ๐Ÿ‘ 1 views

Characters of irreducible representations irreps of the symmetric group corresponding to the two-row Young diagrams, i.e., describing transformation properties of N-electron eigenfunctions of the total spin operators, have been expressed as explicit functions of the number of electrons N and of the

Representations of the symmetric group g
โœ Sten Rettrup; Ruben Pauncz ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 507 KB

The representation matrices generated by the projected spin functions have some very interesting properties. All the matrix elements are integers and they are quite sparse. A very efficient algorithm is presented for the calculation of these representation matrices based on a graphical approach and

The Structure of Some Permutation Module
โœ Darren G.D. Gray ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 301 KB

Suppose that โ€ is an infinite set and k is a natural number. Let โ€ denote the set of all k-subsets of โ€ and let F be a field. In this paper we study the ลฝ . w x k FSym โ€ -submodule structure of the permutation module F โ€ . Using the representation theory of finite symmetric groups, we show that ever