Department of Mathematics

Student GAUSS Seminar

  •  Jamie Schmidt; Alex Sietsema
  •  Pattern Avoidance in Cyclic Permutations
  •  03/12/2021
  •  3:00 PM - 4:00 PM
  •  
  •  Keshav Sutrave (sutravek@msu.edu)

Pattern avoidance in permutations is a well-studied field of enumerative combinatorics. We will discuss the classical version for linear permutations and then introduce a recent variant for cyclic permutations. Finally, we will present our new results counting cyclic avoidance sets for pairs of length 4 patterns and give examples of how those results arise from counting arguments, including a proof for a cyclic variant of the Erdős-Szekeres Therorem.

 

Contact

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