arXiv subjects
Publications and source records attributed to Thomas Brady.
For a finite irreducible real reflection group, $W$, we triangulate its permutahedron and use this to give an explicit homotopy equivalence between two known classifying spaces for the associated Artin group, $B(W)$. In the process, we characterise the Bruhat intervals from $w_1$ to $w_2$ in $W$, where $w_1^{-1}w_2$ is a Coxeter element.
For a finite real reflection group $W$ we use non-crossing partitions of type $W$ to construct finite cell complexes with the homotopy type of the Milnor fiber of the associated $W$-discriminant $Δ_W$ and that of the Milnor fiber of the defining polynomial of the associated reflection arrangement. These complexes support natural cyclic group actions realizing the geometric monodromy. Using the shellability of the non-crossing partition lattice, this cell complex yields a chain complex of homology groups computing the integral homology of the Milnor fiber of $Δ_W$.
We define the notion of a climbing element in a finite real reflection group relative to a total order on the reflection set and we characterise these elements in the case where the total order arises from a bipartite Coxeter element.
For each finite real reflection group $W$, we identify a copy of the type-$W$ simplicial generalised associahedron inside the corresponding simplicial permutahedron. This defines a bijection between the facets of the generalised associahedron and the elements of the type $W$ non-crossing partition lattice which is more tractable than previous such bijections. We show that the simplicial fan determined by this associahedron coincides with the Cambrian fan for $W$.
We describe pure braided versions of Thompson's group F. These groups, $BF$ and $\hat{BF}$, are subgroups of the braided versions of Thompson's group V, introduced by Brin and Dehornoy. Unlike V, elements of F are order-preserving self-maps of the interval and we use pure braids together with elements of F thus preserving order. We define these groups and give normal forms for elements and describe infinite and finite presentations of these groups.
A case-free proof is given that the entries of the $h$-vector of the cluster complex $Δ(Φ)$, associated by S. Fomin and A. Zelevinsky to a finite root system $Φ$, count elements of the lattice $\nc$ of noncrossing partitions of corresponding type by rank. Similar interpretations for the $h$-vector of the positive part of $Δ(Φ)$ are provided. The proof utilizes the appearance of the complex $Δ(Φ)$ in the context of the lattice $\nc$, in recent work of two of the authors, as well as an explicit shelling of $Δ(Φ)$.
We give a case-free proof that the lattice of noncrossing partitions associated to any finite real reflection group is EL-shellable. Shellability of these lattices was open for the groups of type $D_n$ and those of exceptional type and rank at least three.
For a finite real reflection group $W$ with Coxeter element $γ$ we give a uniform proof that the closed interval, $[I, γ]$ forms a lattice in the partial order on $W$ induced by reflection length. The proof involves the construction of a simplicial complex which can be embedded in the type W simplicial generalised associahedron.
In this article we construct a piecewise Euclidean, non-positively curved 2-complex for the 3-generator Artin groups of large type. As a consequence we show that these groups are biautomatic. A slight modification of the proof shows that many other Artin groups are also biautomatic. The general question (whether all Artin groups are biautomatic) remains open.