The combinatorics of a class of representation functions (Q1281887): Difference between revisions
From MaRDI portal
Latest revision as of 18:05, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The combinatorics of a class of representation functions |
scientific article |
Statements
The combinatorics of a class of representation functions (English)
0 references
28 August 2000
0 references
The authors study a class of polynomials that arise from the irreducible representations of the unitary group \(U(n)\). These polynomials have been studied extensively in the physics literature where they are formulated in terms of the boson calculus. This paper serves as an introduction for mathematicians and describes what is needed for a rigorous mathematical treatment. They begin this program by proving the following result. Let \(\alpha\) and \(\beta\) be compositions of \(m\) into \(n\) nonnegative integers. Define the homogeneous polynomial of degree \(m\) in \(z_{ij}\), \(1 \leq i,j \leq n\), by \[ L_{\alpha,\beta}(Z) = \sum_{A\in M(\alpha,\beta)}\prod_{i,j=1}^n z_{ij}^{a_{ij}}/a_{ij}!, \] where \(M(\alpha, \beta)\) is the set of \(n \times n\) nonnegative integral matrices with row sums given by \(\alpha\) and column sums given by \(\beta\). Let \(\alpha!\) be the product of the factorials of the components of \(\alpha\), and let \(D_{\alpha,\beta}(Z) = \sqrt{\alpha! \beta!} L_{\alpha,\beta}(Z)\). Let \(D(Z)\) be the matrix indexed by the compositions of \(m\) with entries \(D_{\alpha,\beta}(Z)\). The authors prove that \(D(XY) = D(X) D(Y)\) and relate this result to MacMahon's master theorem. They also discuss specializations which include the generalized beta function of Gelfand and Graev, Jacobi polynomials, and Clebsch-Gordon coefficients.
0 references
irreducible representations
0 references
unitary group
0 references
beta function
0 references
Jacobi polynomials
0 references
Clebsch-Gordon coefficients
0 references
0 references
0 references