The cyclic sieving phenomenon for noncrossing partitions and m-divisible noncrossing partitions of classical types
碩士 === 國立高雄大學 === 應用數學系碩士班 === 98 === The cyclic sieving phenomenon was introduced by Reiner, Stanton, and White [12]. We use the Orbit-counting Lemma to count the number of orbits of noncrossing partitions and m-divisible noncrossing partitions of classical types, and find the natural q-analogues t...
Main Authors: | Cheng-Tse Liu, 劉誠澤 |
---|---|
Other Authors: | Szu-En Cheng |
Format: | Others |
Language: | en_US |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/04116234109462296931 |
Similar Items
-
Noncrossing partitions, toggles, and homomesies
by: Einstein, David, et al.
Published: (2017) -
Oscillation estimates of eigenfunctions via the combinatorics of noncrossing partitions
by: Vera Mikyoung Hur, et al. -
On a triangulated category which models positive noncrossing partitions
by: Coelho Guardado Simões, Raquel
Published: (2012) -
Oriented flip graphs, noncrossing tree partitions, and representation theory of tiling algebras
by: Garver, A., et al.
Published: (2019) -
Brussels sprouts, noncrossing trees, and parking functions
by: Caleb Ji, et al.
Published: (2020-10-01)