Cyclic sieving is a concept from combinatorics, particularly in the area of enumerative combinatorics, which relates to counting combinatorial objects using the cycle structure of permutations. The main idea behind cyclic sieving is to understand how a family of combinatorial objects can be partitioned or "sieved" based on the action of a finite group, particularly the cyclic group.
Articles by others on the same topic
There are currently no matching articles.