Abstract

It is shown that the Clifford algebra unitary group approach, which is based on the subgroup chain U(2n)⊇SO(2n+1)⊇SO(2n)⊇U(n), may be described in terms of the para-Fermi algebra. Applications to the development of efficient algorithms for the evaluation of matrix elements of U(n) generators and of their products are also briefly discussed.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call