Immanant

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, the immanant of a matrix was defined by Dudley E. Littlewood and Archibald Read Richardson as a generalisation of the concepts of determinant and permanent. Let \lambda=(\lambda_1,\lambda_2,\ldots) be a partition of an integer n and let \chi_\lambda be the corresponding irreducible representation-theoretic character of the symmetric group S_n . The immanant of an n\times n matrix A=(a_{ij}) associated with the character \chi_\lambda is defined as the expression : \operatorname{Imm}_\lambda(A)=\sum_{\sigma\in S_n} \chi_\lambda(\sigma) a_{1\sigma(1)} a_{2\sigma(2)} \cdots a_{n\sigma(n)} = \sum_{\sigma\in S_n} \chi_\lambda(\sigma) \prod_{i=1}^{n} a_{i\sigma(i)}.

In mathematics, the immanant of a matrix was defined by Dudley E. Littlewood and Archibald Read Richardson as a generalisation of the concepts of determinant and permanent. Let \lambda=(\lambda_1,\lambda_2,\ldots) be a partition of an integer n and let \chi_\lambda be the corresponding irreducible representation-theoretic character of the symmetric group S_n . The immanant of an n\times n matrix A=(a_{ij}) associated with the character \chi_\lambda is defined as the expression \operatorname{Imm}_\lambda(A)=\sum_{\sigma\in S_n} \chi_\lambda(\sigma) a_{1\sigma(1)} a_{2\sigma(2)} \cdots a_{n\sigma(n)} = \sum_{\sigma\in S_n} \chi_\lambda(\sigma) \prod_{i=1}^{n} a_{i\sigma(i)}.

Examples

The determinant is a special case of the immanant, where \chi_\lambda is the alternating character \sgn , of S n , defined by the parity of a permutation. The permanent is the case where \chi_\lambda is the trivial character, which is identically equal to 1. For example, for 3 \times 3 matrices, there are three irreducible representations of S_3 , as shown in the character table: As stated above, \chi_1 produces the permanent and \chi_2 produces the determinant, but \chi_3 produces the operation that maps as follows: \begin{pmatrix} a_{11} & a_{12} & a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33} \end{pmatrix} \rightsquigarrow 2 a_{11} a_{22} a_{33} - a_{12} a_{23} a_{31} - a_{13} a_{21} a_{32}

Properties

The immanant shares several properties with determinant and permanent. In particular, the immanant is multilinear in the rows and columns of the matrix; and the immanant is invariant under simultaneous permutations of the rows or columns by the same element of the symmetric group. Littlewood and Richardson studied the relation of the immanant to Schur functions in the representation theory of the symmetric group. The necessary and sufficient conditions for the immanant of a Gram matrix to be 0 are given by Gamas's Theorem.

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1370450834 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.