Algorithms for SU(n) boson realizations and D-functions

TL;DR

This paper introduces a graph-theoretic algorithm for constructing boson realizations of SU(n) basis states and their D-functions, providing a more efficient method than existing approaches.

Contribution

It presents a novel graph-based algorithm for SU(n) boson realizations and D-function computations, improving efficiency over previous methods.

Findings

The algorithm effectively constructs SU(n) boson realizations for arbitrary n.

It enables efficient calculation of D-functions for SU(n) irreducible representations.

The method outperforms factorization and exponentiation procedures.

Abstract

Boson realizations map operators and states of groups to transformations and states of bosonic systems. We devise a graph-theoretic algorithm to construct the boson realizations of the canonical SU$(n)$ basis states, which reduce the canonical subgroup chain, for arbitrary $n$. The boson realizations are employed to construct $\mathcal{D}$-functions, which are the matrix elements of arbitrary irreducible representations, of SU$(n)$ in the canonical basis. We demonstrate that our $\mathcal{D}$-function algorithm offers significant advantage over the two competing procedures, namely factorization and exponentiation.