Department of Mathematics

Combinatorics and Graph Theory

  •  Samantha Dahlberg, Arizona State University
  •  Diameters of Graphs of Reduced Words of Permutations, Zoom
  •  09/16/2020
  •  3:00 PM - 3:50 PM
  •  Online (virtual meeting)

It is a classical result that any two reduced words of a permutation in the symmetric group can be transformed into one another by a sequence of long braid moves and commutation moves. In this talk we will discuss the diameters of these connected graphs formed from the reduced words connected by single moves. Recently, the diameter has been calculated for the longest permutation $n\ldots 21$ by Reiner and Roichman as well as Assaf. In this talk we present our results on diameters for certain classes or permutation . We also make progress on conjectured bounds of the diameter by Reiner and Roichman, which are based on the underlying hyperplane arrangement.



Department of Mathematics
Michigan State University
619 Red Cedar Road
C212 Wells Hall
East Lansing, MI 48824

Phone: (517) 353-0844
Fax: (517) 432-1562

College of Natural Science