Skip to content

Forgotten characters

Kyle Celano, Brendon Rhoades

math.COarXiv:2608.20002

Abstract

A partial permutation of [n] := \1,…,n\ is a bijection g: I J between two subsets I,J ⊂eq [n]. Given a partial permutation g of [n], let ag ∈ C[Sn] be the group algebra sum of those permutations w ∈ Sn which extend g. Informally, a partial permutation g is obtained by forgetting some data in a genuine permutation. The forgotten symmetric functions are the least-studied of the six `standard' bases for the ring of symmetric functions. We show that forgotten symmetric functions arise naturally in class function evaluations on partial permutations.

Create a lesson