Title: Cyclic sieving with focus on open problemsSpeaker:
Stockholm UniversityRoom/Zoom: MC5479 or for Zoom link contact Logan Crew or Olya Mandelshtam
The cyclic sieving phenomenon (CSP) connects a cyclic group action on a family of combinatorial objects with some q-analog of that set. We discuss some recent results and open problems for standard and semistandard tableaux, as well as some other families of combinatorial objects.
Several open problems with various levels of difficulty will be presented.