We present an algorithm for the efficient construction of many-particle wave functions that belong to a given O(4) irreducible representation and are at the same time characterized by a well-defined permutational symmetry. The construction proceeds recursively, generating and then using sets of O(4)
Classification of interaction operators with respect to many-particle permutation symmetry
โ Scribed by A. van der Avoird; P.E.S. Wormer
- Publisher
- Elsevier Science
- Year
- 1972
- Tongue
- English
- Weight
- 396 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0009-2614
No coin nor oath required. For personal study only.
โฆ Synopsis
TWO procedures Qr(: dcveiopcd for the ~lassi~i~atiun of interaction opfrstors with respect to the permutation symmetry of a many (N) partick system, which is a necessary tist step for deriving seiection rules for matrix elements of spin dependent operators over many-particle wavefunctions.
The first method, based on character relations in the sqtmmetric group .S,, is spplied to one-and two-particte operators The second, using Young diagrams is easily appkd to the general exe of n-particle interaction operators.
1. introduction
Recently, Musher Cl] has derived selection rules for matrix elements of spin-dependent operators over many-electron
๐ SIMILAR VOLUMES