Fixed-Point-Free Involution Word Diagrams
Loading...
Date
2022-10-04
Authors
Potter, Jake
Journal Title
Journal ISSN
Volume Title
Publisher
University of Oregon
Abstract
We define a useful diagram for studying fixed-point-free involution words. Following the example of Little, we define a specific and a general bumping algorithm on these diagrams. These algorithms serve as the basis for bijective proofs of corresponding transition equations for fixed-point-free involution Stanley symmetric functions. We also use the diagrams to show deletion and exchange properties of FPF involution words.
Description
Keywords
bumping algorithm, fixed-point-free, involutions