Search arXivSearch

arXiv · 2607.04999

Cluster parking functions II: $q,t$-dihedral sieving via diagonal coinvariants

Abstract

In a previous work, we defined the complex of cluster parking functions. On one side, they encode the type-refined enumeration of faces of the cluster complex, and on the other side, they have a reduced homology which is isomorphic to (ungraded) diagonal coinvariants. The goal of this work is to take into account the underlying dihedral symmetry. We thus have a product of a dihedral group and a symmetric group (there is a precise conjecture in the case of other finite Coxeter groups, but we focus on symmetric groups because of technicalities about diagonal coinvariants beyond this case). Under the action of the product group, the reduced homology of cluster parking functions is conjecturally isomorphic to diagonal coinvariants up to tensoring by a sign character of the dihedral group. This isomorphism can be reformulated as a dihedral sieving phenomenon. The main technical contribution is the definition of the dihedral automorphism group of cluster parking functions, and we discuss various features of the reduced homology character and its conjectural connection with diagonal coinvariants.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthieu Josuat-Vergès. 2026-07-06. Cluster parking functions II: $q,t$-dihedral sieving via diagonal coinvariants. https://arxiv.org/abs/2607.04999

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO