An insertion algorithm for catabolizability
From MaRDI portal
Abstract: Motivated by our recent work relating canonical bases to combinatorics of Garsia-Procesi modules cite{B}, we give an insertion algorithm that computes the catabolizability of the insertion tableau of a standard word. This allows us to characterize catabolizability as the statistic on words invariant under Knuth transformations, certain (co)rotations, and a new operation called a catabolism transformation. We also prove a Greene's Theorem-like characterization of catabolizability, and a result about how cocyclage changes catabolizability, strengthening a similar result in cite{SW}.
Recommendations
Cites work
- Cyclage, catabolism, and the affine Hecke algebra.
- Graded characters of modules supported in the closure of a nilpotent conjugacy class
- scientific article; zbMATH DE number 475643 (Why is no real title available?)
- scientific article; zbMATH DE number 2068005 (Why is no real title available?)
- scientific article; zbMATH DE number 3799574 (Why is no real title available?)
- On certain graded \(S_ n\)-modules and the \(q\)-Kostka polynomials
- Tableau atoms and a new Macdonald positivity conjecture
- The based ring of two-sided cells of affine Weyl groups of type ̃𝐴_{𝑛-1}
Cited in
(4)
This page was built for publication: An insertion algorithm for catabolizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658011)