Search arXivSearch

arXiv · 2206.05721

On the homology of the noncrossing partition lattice and the Milnor fibre

Abstract

Let $\mathcal{L}$ be the noncrossing partition lattice associated to a finite Coxeter group $W$. In this paper we construct explicit bases for the top homology groups of intervals and rank-selected subposets of $\mathcal{L}$. We define a multiplicative structure on the Whitney homology of $\mathcal{L}$ in terms of the basis, and the resulting algebra has similarities to the Orlik-Solomon algebra. As an application, we obtain four chain complexes which compute the integral homology of the Milnor fibre of the reflection arrangement of $W$, the Milnor fibre of the discriminant of $W$, the hyperplane complement of $W$ and the Artin group of type $W$, respectively. We also tabulate some computational results on the integral homology of the Milnor fibres.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yang Zhang. 2023-01-24. On the homology of the noncrossing partition lattice and the Milnor fibre. https://arxiv.org/abs/2206.05721

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