Search arXivSearch

arXiv · 2509.11905

Homology character of the parabolic coset poset

Abstract

Motivated by the analogy with the Coxeter complex on one side, and parking functions on the other side, we study the poset of parabolic cosets in a finite Coxeter group. We show that this poset is Cohen-Macaulay, and get an explicit formula for the character of its (unique) nonzero homology group in terms of the Möbius function of the intersection lattice. This homology character becomes a positive element of the parabolic Burnside ring (in its natural basis) after tensoring with the sign character. The coefficients of this character essentially encode the colored $h$-vector of the positive chamber complex (following Bastidas, Hohlweg, and Saliola, this complex is defined by taking Weyl chambers that lie on the positive side of a generic hyperplane). Roughly speaking, tensoring by the sign character on one side corresponds to the transformation going from the $f$-vector to the $h$-vector on the other side.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Theo Douvropoulos, Matthieu Josuat-Vergès. 2025-09-15. Homology character of the parabolic coset poset. https://arxiv.org/abs/2509.11905

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