Irreducible Character Immanants in Matrix Theory

• Irreducible character immanants are matrix functions defined via symmetric group characters that generalize both determinants and permanents.
• They are constructed by weighting permutation products with irreducible character values, linking representation theory with combinatorial properties of Young diagrams.
• Recent studies classify their vanishing on alternating matrices and extend the concept through partition-algebra generalizations and quasisymmetric refinements.

Searching arXiv for the cited papers to ground the article in current records. Irreducible character immanants are matrix functions attached to irreducible characters of symmetric groups. For a partition $\lambda \vdash n$, with irreducible character $\chi^\lambda$ of $S_n$, the associated immanant of an $n\times n$ matrix $A=[a_{ij}]$ is

$$\operatorname{Imm}^{\lambda}(A)=\sum_{\sigma\in S_n}\chi^\lambda(\sigma)\prod_{i=1}^n a_{i,\sigma(i)}.$$

This construction interpolates between the determinant and the permanent: when $\lambda=(1^n)$, $\chi^\lambda$ is the sign character and the immanant becomes $\det(A)$, while when $\lambda=(n)$, $\chi^\lambda$0 is the trivial character and the immanant becomes $\chi^\lambda$1 (Campbell, 2023). Recent work places irreducible character immanants at the intersection of symmetric-group representation theory, Young-diagram combinatorics, partition-algebra generalizations, quasisymmetric refinements, and quantum/Capelli analogues (Cheraghpour et al., 2024).

1. Classical definition and special cases

The classical immanant is defined by weighting permutation monomials with irreducible character values of $\chi^\lambda$2: $\chi^\lambda$3 where $\chi^\lambda$4 denotes the cycle type of $\chi^\lambda$5 (Campbell, 26 Jan 2025). Because irreducible characters are constant on conjugacy classes, the coefficient depends only on cycle type, even though the sum itself is indexed by permutations.

The determinant and permanent are the extremal examples recorded in the recent literature. For $\chi^\lambda$6 one obtains the determinant, and for $\chi^\lambda$7 one obtains the permanent (Campbell, 2023). In this sense, irreducible character immanants form a family of permutation-indexed matrix invariants that interpolate between alternating and totally symmetric coefficient systems.

This formulation is the one retained across several extensions. The partition-algebra paper writes the classical object as

$\chi^\lambda$8

and uses it as the specialization target for a broader construction (Campbell, 2023). The quasi-immanant paper likewise takes the irreducible character immanant as its starting point before refining the coefficient system from cycle types to cycle compositions (Campbell, 26 Jan 2025).

2. Indexing by partitions, Young diagrams, and symmetric functions

Irreducible characters $\chi^\lambda$9 of $S_n$0 are indexed by partitions $S_n$1, equivalently by Young diagrams $S_n$2 (Cheraghpour et al., 2024). This indexing is not merely notational: the combinatorics of the partition controls concrete properties of the corresponding immanant, including vanishing phenomena on structured matrix spaces.

The symmetric-function organization of these coefficients is expressed through the Frobenius characteristic map

$S_n$3

under which

$S_n$4

Thus the irreducible character coefficients appearing in immanants are exactly the power-sum coefficients of Schur functions (Campbell, 26 Jan 2025). This point is central in later generalizations: some constructions replace $S_n$5 by coefficients attached to other symmetric or quasisymmetric bases, while preserving the permutation-monomial part of the definition.

A recurrent theme is that the partition $S_n$6 should be viewed simultaneously in three ways: as the label of an irreducible $S_n$7-character, as a Young diagram governing rim-hook combinatorics, and as the Schur-function index under Frobenius. This suggests that irreducible character immanants are best understood as representation-theoretic matrix functions whose analytic behavior is often encoded diagrammatically.

3. Vanishing on alternating matrices

A recent classification determines exactly which irreducible character immanants vanish identically on the space of alternating complex matrices (Cheraghpour et al., 2024). For

$S_n$8

and for an irreducible character $S_n$9 of $n\times n$0,

$n\times n$1

the identities

$n\times n$2

imply

$n\times n$3

Hence if $n\times n$4 is odd, then $n\times n$5 for every alternating matrix $n\times n$6 (Cheraghpour et al., 2024).

The even-dimensional case is the substantive one. A reduction due to Duffner et al. shows that, for even $n\times n$7, only permutations with no odd cycles matter on alternating matrices. Writing $n\times n$8 for the set of permutations whose cycle type has no odd cycles, one has

$n\times n$9

for alternating $A=[a_{ij}]$0 (Cheraghpour et al., 2024). Therefore the problem of deciding whether an irreducible immanant vanishes identically on $A=[a_{ij}]$1 reduces to deciding whether the corresponding character vanishes on all of $A=[a_{ij}]$2.

The main classification theorem states that for an irreducible character $A=[a_{ij}]$3 of $A=[a_{ij}]$4,

$A=[a_{ij}]$5

and consequently

$A=[a_{ij}]$6

if and only if either $A=[a_{ij}]$7 is odd, or $A=[a_{ij}]$8 is even and $A=[a_{ij}]$9 is induced by an indestructible diagram (Cheraghpour et al., 2024). The same paper also shows that, for even $$\operatorname{Imm}^{\lambda}(A)=\sum_{\sigma\in S_n}\chi^\lambda(\sigma)\prod_{i=1}^n a_{i,\sigma(i)}.$$0, the condition

$$\operatorname{Imm}^{\lambda}(A)=\sum_{\sigma\in S_n}\chi^\lambda(\sigma)\prod_{i=1}^n a_{i,\sigma(i)}.$$1

is equivalent to $$\operatorname{Imm}^{\lambda}(A)=\sum_{\sigma\in S_n}\chi^\lambda(\sigma)\prod_{i=1}^n a_{i,\sigma(i)}.$$2 being induced by an indestructible diagram, giving a concrete test matrix for the vanishing property (Cheraghpour et al., 2024).

A technical addendum in the same work corrects an earlier statement on immanant-converting maps. The automatic linearity and bijectivity of a map $$\operatorname{Imm}^{\lambda}(A)=\sum_{\sigma\in S_n}\chi^\lambda(\sigma)\prod_{i=1}^n a_{i,\sigma(i)}.$$3 satisfying

$$\operatorname{Imm}^{\lambda}(A)=\sum_{\sigma\in S_n}\chi^\lambda(\sigma)\prod_{i=1}^n a_{i,\sigma(i)}.$$4

requires an extra hypothesis on $$\operatorname{Imm}^{\lambda}(A)=\sum_{\sigma\in S_n}\chi^\lambda(\sigma)\prod_{i=1}^n a_{i,\sigma(i)}.$$5, namely that for every $$\operatorname{Imm}^{\lambda}(A)=\sum_{\sigma\in S_n}\chi^\lambda(\sigma)\prod_{i=1}^n a_{i,\sigma(i)}.$$6 there exists $$\operatorname{Imm}^{\lambda}(A)=\sum_{\sigma\in S_n}\chi^\lambda(\sigma)\prod_{i=1}^n a_{i,\sigma(i)}.$$7 with $$\operatorname{Imm}^{\lambda}(A)=\sum_{\sigma\in S_n}\chi^\lambda(\sigma)\prod_{i=1}^n a_{i,\sigma(i)}.$$8 and $$\operatorname{Imm}^{\lambda}(A)=\sum_{\sigma\in S_n}\chi^\lambda(\sigma)\prod_{i=1}^n a_{i,\sigma(i)}.$$9; the paper proves this holds automatically when $\lambda=(1^n)$0, but may fail in characteristic $\lambda=(1^n)$1 (Cheraghpour et al., 2024).

4. Domino rim-hooks, tilings, and the partition criterion

The classification of vanishing immanants on alternating matrices is combinatorial. A domino is a $\lambda=(1^n)$2 or $\lambda=(1^n)$3 pair of edge-adjacent cells, and a domino rim-hook is a rim-hook of length $\lambda=(1^n)$4, equivalently a removable horizontal or vertical domino that leaves a valid Young diagram. A Young diagram is called destructible if one can recursively remove domino rim-hooks until nothing remains; otherwise it is indestructible (Cheraghpour et al., 2024).

Two structural lemmas organize this recursive removal process. First, if a diagram has two disjoint domino rim-hooks $\lambda=(1^n)$5 and $\lambda=(1^n)$6, then $\lambda=(1^n)$7 remains a domino rim-hook after removing $\lambda=(1^n)$8. Second, for a diagram of even size,

$\lambda=(1^n)$9

for any domino rim-hook $\chi^\lambda$0 (Cheraghpour et al., 2024). These facts make domino removal stable under order and reduce the global question of complete dismantling to local removability.

The key obstruction is the triangular diagram

$\chi^\lambda$1

A diagram is triangular if and only if it has no domino rim-hook, and therefore every triangular diagram is indestructible. More generally, a diagram is indestructible exactly when every domino-removal process eventually ends in a triangular diagram (Cheraghpour et al., 2024). This yields a structural picture in which destructible diagrams reduce to the empty diagram, while indestructible diagrams terminate at a triangular core.

The representation-theoretic mechanism behind the classification is the Murnaghan–Nakayama rule, together with the auxiliary fact that a rim-hook of length $\chi^\lambda$2 can be peeled off in $\chi^\lambda$3 successive rim-hook removals each of length $\chi^\lambda$4 (Cheraghpour et al., 2024). This permits a reduction from character values on permutations with even cycle lengths to repeated domino-removal.

For destructible diagrams, the paper derives a precise formula for the value on cycle type $\chi^\lambda$5: $\chi^\lambda$6 where $\chi^\lambda$7 is the set of domino tilings of $\chi^\lambda$8 and

$\chi^\lambda$9

A further lemma shows that if $\det(A)$0 is the number of vertical dominoes in any tiling, then

$\det(A)$1

Thus the sign contribution from every tiling is uniform, and the character value is a signed count of tilings (Cheraghpour et al., 2024). From this, one obtains the dichotomy: indestructible diagrams force vanishing on all $\det(A)$2, while destructible diagrams do not vanish identically there.

5. Partition-algebra generalization: recombinants

One recent generalization replaces symmetric-group characters by partition-algebra characters and replaces permutations by the full diagram basis of the partition algebra (Campbell, 2023). For a square matrix $\det(A)$3 and an irreducible character $\det(A)$4 of the partition algebra $\det(A)$5, the associated function is the recombinant: $\det(A)$6 where $\det(A)$7 is the full diagram basis. The product is defined diagrammatically by propagating blocks, and if a diagram has propagation number $\det(A)$8, the product is declared to be $\det(A)$9 (Campbell, 2023).

This is a genuine enlargement of the irreducible character immanant paradigm. In the classical case, the indexing set is $\lambda=(n)$0, so every summand corresponds to a perfect matching between top and bottom indices. In the recombinant, the indexing set is the whole diagram basis of $\lambda=(n)$1, including diagrams with propagating and non-propagating blocks (Campbell, 2023). The weight system is therefore no longer a class function on $\lambda=(n)$2.

The relation to irreducible character immanants is nevertheless exact in the “top” part of the partition-algebra Bratteli diagram. If the vacillating tableau data end at an ordinary partition of size $\lambda=(n)$3, then

$\lambda=(n)$4

where $\lambda=(n)$5 is the corresponding symmetric-group partition (Campbell, 2023). The proof uses the fact that non-propagating diagrams contribute $\lambda=(n)$6 in this case, so the sum collapses to propagating diagrams, ანუ to permutation diagrams, and the partition-algebra character values become the symmetric-group character values.

The same paper explicitly distinguishes recombinants from $\lambda=(n)$7-immanants, Temperley–Lieb immanants, and Kazhdan–Lusztig families. The distinction is structural rather than terminological: the recombinant is not a permutation-indexed sum with an arbitrary weight function on $\lambda=(n)$8, but a partition-algebraic character sum over all partition diagrams (Campbell, 2023).

6. Quasisymmetric refinements and quasi-immanants

A different line of development refines irreducible character immanants by replacing cycle types with cycle compositions and replacing symmetric functions with quasisymmetric functions (Campbell, 26 Jan 2025). For a permutation $\lambda=(n)$9, the cycle composition $\chi^\lambda$00 is obtained by writing each cycle in increasing order, sorting the cycles lexicographically, and then taking the sequence of their lengths. This refines $\chi^\lambda$01: two permutations with the same cycle type may have different cycle compositions (Campbell, 26 Jan 2025).

Using the quasisymmetric power-sum bases $\chi^\lambda$02 and $\chi^\lambda$03, the paper defines quasi-immanants

$\chi^\lambda$04

and analogously $\chi^\lambda$05 (Campbell, 26 Jan 2025). When $\chi^\lambda$06 is symmetric, these constructions recover the classical immanant. In particular,

$\chi^\lambda$07

because the Schur function $\chi^\lambda$08 has the usual power-sum expansion with coefficients $\chi^\lambda$09 (Campbell, 26 Jan 2025).

The refinement becomes genuinely new for quasisymmetric inputs. The paper studies the quasisymmetric Schur function $\chi^\lambda$10 as an analogue of the classical second immanant and proves an explicit coefficient formula for

$\chi^\lambda$11

For $\chi^\lambda$12, the coefficient $\chi^\lambda$13 depends on the first part of $\chi^\lambda$14: it is nonzero only when that first part is $\chi^\lambda$15 or $\chi^\lambda$16, and in those cases is given by a sign times the number of $\chi^\lambda$17-permutations with the same cycle type as $\chi^\lambda$18 (Campbell, 26 Jan 2025). This is a composition-level refinement of classical character-immanant combinatorics.

The $\chi^\lambda$19 example makes the distinction concrete. The quasi-immanant

$\chi^\lambda$20

differs from the classical second immanant

$\chi^\lambda$21

(Campbell, 26 Jan 2025). This shows that quasi-immanants do not merely repackage irreducible character immanants; they refine them by retaining ordered cycle-decomposition data that ordinary cycle type forgets.

7. Quantum immanants and Capelli analogues

In the setting of $\chi^\lambda$22, the objects called quantum immanants are realized as central elements $\chi^\lambda$23, the Schur elements, defined by

$\chi^\lambda$24

where the sum runs over row strictly increasing Young tableaux $\chi^\lambda$25 of shape $\chi^\lambda$26, $\chi^\lambda$27 is the hook-number, and $\chi^\lambda$28 is a double Young-Capelli bitableau (Brini et al., 2021). The paper emphasizes that this presentation is character-free: it does not define the objects through irreducible characters of symmetric groups.

The same work proves that these Schur elements are the same as the Okounkov quantum immanants and that under the Harish-Chandra isomorphism

$\chi^\lambda$29

one has

$\chi^\lambda$30

the shifted Schur polynomial (Brini et al., 2021). Their representation-theoretic characterization is triangular: if $\chi^\lambda$31 is a partition with $\chi^\lambda$32, then $\chi^\lambda$33; if $\chi^\lambda$34, then $\chi^\lambda$35; and if $\chi^\lambda$36 but $\chi^\lambda$37, the action also vanishes (Brini et al., 2021).

The connection back to irreducible character immanants is explicit but secondary. Proposition 4.8 in the paper writes $\chi^\lambda$38 as a linear combination of diagonal Capelli immanants: $\chi^\lambda$39 so the character-theoretic Capelli immanants appear as an alternative expansion of the same central element (Brini et al., 2021). In this sense, irreducible character immanants persist inside the quantum theory not as the primary definition, but as one coordinate system for tableau-defined central elements.

Special Schur elements recover two classical central families: $\chi^\lambda$40 the Capelli elements and the Nazarov-Umeda elements, respectively (Brini et al., 2021). Their eigenvalues are described by horizontal-strip and vertical-strip combinatorics, and the involution $\chi^\lambda$41 on the center satisfies

$\chi^\lambda$42

so partition conjugation becomes an internal duality of the quantum-immanant framework (Brini et al., 2021). This suggests that the classical irreducible character immanant sits inside a broader network in which Young-diagram combinatorics governs both matrix functions and central elements of enveloping algebras.