摘要

Based on computational experiments, Jim Propp and Vic Reiner suspected that there might exist a sequence of combinatorial objects X-n, each carrying a natural action of the cyclic group Cn-1 of order n - 1 such that the triple (X-n, Cn-1, 1/[n+1]q [(2n)(n)](q)) exhibits the cyclic sieving phenomenon. We prove their suspicion right.

  • 出版日期2017-3

全文