Young, BenjaminPotter, Jake2022-10-042022-10-042022-10-04https://hdl.handle.net/1794/27636We 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.en-USAll Rights Reserved.bumping algorithmfixed-point-freeinvolutionsElectronic Thesis or Dissertation