Quasi-immanants
Abstract
For an integer partition λ of n and an n × n matrix A, consider the expansion of the immanant Immλ(A) as a sum indexed by permutations σ of order n, with coefficients given by the irreducible characters λ(ctype(σ)) of the symmetric group Sn, for the cycle type ctype(σ) n of σ. Skandera et al. have introduced combinatorial interpretations of a generalization of immanants given by replacing the coefficient λ(ctype(σ)) with preimages with respect to the Frobenius morphism of elements among the distinguished bases of the algebra Sym of symmetric functions. Since Sym is contained in the algebra QSym of quasisymmetric functions, this leads us to further generalize immanants with the use of quasisymmetric functions. Since bases of QSym are indexed by integer compositions, we make use of cycle compositions in place of cycle types to define the family of quasi-immanants introduced in this paper. This is achieved through the use of the quasisymmetric power sum bases due to Ballantine et al., and we prove a combinatorial formula for the coefficients arising in an analogue, given by a special case of quasi-immanants associated with quasisymmetric Schur functions, of second immanants.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.