2000 character limit reached
Macdonald polynomials and cyclic sieving
Published 19 Feb 2021 in math.CO | (2102.09982v2)
Abstract: The Garsia--Haiman module is a bigraded $\mathfrak{S}_n$-module whose Frobenius image is a Macdonald polynomial. The method of orbit harmonics promotes an $\mathfrak{S}_n$-set $X$ to a graded polynomial ring. The orbit harmonics can be applied to prove cyclic sieving phenomena which is a notion that encapsulates the fixed-point structure of finite cyclic group action on a finite set. By applying this idea to the Garsia--Haiman module, we provide cyclic sieving results regarding the enumeration of matrices that are invariant under certain cyclic row and column rotation and translation of entries.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.