The cyclic sieving phenomenon on circular Dyck paths (Q2327231)

Summary: We give a \(q\)-enumeration of circular Dyck paths, which is a superset of the classical Dyck paths enumerated by the Catalan numbers. These objects have recently been studied by \textit{P. Alexandersson} and \textit{G. Panova} [Discrete Math. 341, No. 12, 3453--3482 (2018; Zbl 1397.05197)]. Furthermore, we show that this \(q\)-analogue exhibits the cyclic sieving phenomenon under a natural action of the cyclic group. The enumeration and cyclic sieving is generalized to Möbius paths. We also discuss properties of a generalization of cyclic sieving, which we call subset cyclic sieving, and introduce the notion of Lyndon-like cyclic sieving that concerns special recursive properties of combinatorial objects exhibiting the cyclic sieving phenomenon.