Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1712.07812

Cyclic Sieving of Matchings

Qingzhong Liang·Grant Bowling
View original source ↗Read source document ↗Export metadata ↓

Abstract

The cyclic sieving phenomenon (CSP) was introduced by Reiner, Stanton, and White to study combinatorial structures with actions of cyclic groups. The crucial step is to find a polynomial, for example a q-analog, that satisfies the CSP conditions for an action. This polynomial will give us a lot of information about the symmetry and structure of the set under the action. In this paper, we study the cyclic sieving phenomenon of the cyclic group $C_{2n}$ acting on $P_{n,k}$, which is the set of matchings of $2n$ points on a circle with $k$ crossings. The noncrossing matchings ($k=0$) was recently studied as a Catalan object. In this paper, we study more general cases, the matchings with more number of crossings. We prove that there exists $q$-analog polynomials $f_{n,k}(q)$ such that $(P_{n,k},f_{n,k},C_{2n})$ exhibits the cyclic sieving phenomenon for $k=1,2,3$. In the proof, we also introduce an efficient representation of the elements in $P_{n,k}$, which helps us to understand the symmetrical structure of the set.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qingzhong Liang, Grant Bowling. 2017-12-21. Cyclic Sieving of Matchings. https://arxiv.org/abs/1712.07812

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗