pith. sign in

arxiv: 2512.18656 · v3 · pith:MVTDJKMBnew · submitted 2025-12-21 · 🧮 math.CO

Cyclic sieving phenomena for trees and tree-rooted maps

classification 🧮 math.CO
keywords treesrootcyclicnextsievingactionconsideredcorner
0
0 comments X
read the original abstract

We prove cyclic sieving phenomena satisfied by corner-rooted plane trees (alias ordered trees). The sets of rooted plane trees that we consider are: (1) all trees with $n$ nodes; (2) all trees with $n$ nodes and $k$ leaves; (3) all trees with a given degree distribution of the nodes. Moreover, we consider four different cyclic group actions: (1) the root is moved to the next corner along a tour of the tree; (2) only trees in which the root is at a leaf are considered, and the action moves the root to the next leaf; (3) only trees in which the root is at a non-leaf are considered, and the action moves the root to the next non-leaf corner; (4) only trees in which the root is at a node of degree $\delta$ are considered, for a fixed $\delta$, and the action moves the root to the next corner of this type. We prove a cyclic sieving phenomenon for each meaningful combination of these sets and actions. As a bonus, we also establish corresponding cyclic sieving phenomena for tree-rooted planar maps.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.