Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0612679

The Cyclic Sieving Phenomenon for Faces of Generalized Cluster Complexes

Sen-Peng Eu·Tung-Shan Fu
View original source ↗Read source document ↗Export metadata ↓

Abstract

The notion of cyclic sieving phenomenon is introduced by Reiner, Stanton, and White as a generalization of Stembridge's $q=-1$ phenomenon. The generalized cluster complexes associated to root systems are given by Fomin and Reading as a generalization of the cluster complexes found by Fomin and Zelevinsky. In this paper, the faces of various dimensions of the generalized cluster complexes in type $A_n$, $B_n$, $D_n$, and $I_2(a)$ are shown to exhibit the cyclic sieving phenomenon under a cyclic group action. For the cluster complexes of exceptional type $E_6$, $E_7$, $E_8$, $F_4$, $H_3$, and $H_4$, a verification for such a phenomenon on their maximal faces is given.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sen-Peng Eu, Tung-Shan Fu. 2006-12-22. The Cyclic Sieving Phenomenon for Faces of Generalized Cluster Complexes. https://arxiv.org/abs/math/0612679

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

KEEP EXPLORING

Related papers

arXiv2026

A Survey of Graph Polynomials Related to the Chromatic Polynomial

Introduced by Birkhoff in 1912 to study the four-color conjecture, the chromatic polynomial has become one of the most extensively studied graph polynomials. It is closely connected to the Tutte polynomial through specialization, to the characteristic polynomial of the associated graphic matroid, and to the flow polynomial through planar duality. It has also inspired several related polynomials, including the $σ$-polynomial, the $w$-polynomial, and the $τ$-polynomial. This survey examines these relationships, illustrated in Figure 1, and reviews the main results.

math.CO↗
arXiv2026

Logarithmically larger deletion codes of all distances

The deletion distance between two binary words $u,v \in \{0,1\}^n$ is the smallest $k$ such that $u$ and $v$ share a common subsequence of length $n-k$. A set $C$ of binary words of length $n$ is called a $k$-deletion code if every pair of distinct words in $C$ has deletion distance greater than $k$. In 1965, Levenshtein initiated the study of deletion codes by showing that, for $k\ge 1$ fixed and $n$ going to infinity, a $k$-deletion code $C\subseteq \{0,1\}^n$ of maximum size satisfies $Ω_k(2^n/n^{2k}) \leq |C| \leq O_k( 2^n/n^k)$. We make the first asymptotic improvement to these bounds by showing that there exist $k$-deletion codes with size at least $Ω_k(2^n \log n/n^{2k})$. Our proof is inspired by Jiang and Vardy's improvement to the classical Gilbert--Varshamov bounds. We also establish several related results on the number of longest common subsequences and shortest common supersequences of a pair of words with given length and deletion distance.

math.CO↗
arXiv2026

On the Number of Almost Empty Monochromatic Triangles

In this paper, we consider the problem of counting almost empty monochromatic triangles in colored planar point sets, that is, triangles whose vertices are all assigned the same color and that contain only a few interior points. Specifically, we show that any $c$-coloring of a set of $n$ points in the plane in general position (that is, no three on a line) contains $Ω(n^2)$ monochromatic triangles with at most $c-1$ interior points and $Ω(n^{\frac{4}{3}})$ monochromatic triangles with at most $c-2$ interior points, for any fixed $c \geq 2$. The latter, in particular, generalizes the result of Pach and Tóth (2013) on the number of monochromatic empty triangles in 2-colored point sets, to the setting of multiple colors and monochromatic triangles with a few interior points. We also derive the limiting value of the expected number of triangles with $s$ interior points in random point sets, for any integer $s \geq 0$. As a result, we obtain the expected number of monochromatic triangles with at most $s$ interior points in random colorings of random point sets.

math.CO↗