The cyclic sieving phenomenon for non-crossing forests

zbMATH Open1253.05016arXiv1106.0992MaRDI QIDQ456319FDOQ456319

Authors: Stefan Kluge 

Publication date: 24 October 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: In this paper we prove that the set of non-crossing forests together with a cyclic group acting on it by rotation and a natural q-analogue of the formula for their number exhibits the cyclic sieving phenomenon, as conjectured by Alan Guo.

Full work available at URL: https://arxiv.org/abs/1106.0992

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Cyclic sieving for two families of non-crossing graphs
• The cyclic sieving phenomenon
• Cyclic sieving and rational Catalan theory
• scientific article
• Cyclic sieving phenomenon in non-crossing connected graphs

zbMATH Keywords

cyclic sievingnon-crossing forests

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Cited In (7)

• Title not available (Why is that?)
• Cyclic sieving phenomenon in non-crossing connected graphs
• On self-complementary cyclic packing of forests
• Jeu-de-taquin promotion and a cyclic sieving phenomenon for semistandard hook tableaux
• A decomposition algorithm for noncrossing trees
• Decomposition and merging algorithms for noncrossing forests
• Cyclic sieving for two families of non-crossing graphs

This page was built for publication: The cyclic sieving phenomenon for non-crossing forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456319)