2000 character limit reached
The sieving phenomenon for finite groups
Published 29 Mar 2018 in math.CO | (1803.11122v1)
Abstract: The cyclic sieving phenomenon is a well-studied occurrence in combinatorics appearing when a cyclic group acts on a finite set. In this paper, we demonstrate a natural extension of this theory to finite abelian groups. We also present a similar result for dihedral groups and suggest approaches for natural generalizations to nonabelian groups.
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.