Forgotten characters
Kyle Celano, Brendon Rhoades
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
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato