activity
20012026
most citedLattices in finite real reflection groups

18 citations · 25 across the 7 of their papers we have counts for

collaborators

8 papers

math.GR2026

Triangulating the Permutahedron

Thomas Brady, Emanuele Delucchi, Colum Watt

For a finite irreducible real reflection group, , we triangulate its permutahedron and use this to give an explicit homotopy equivalence between two known classifying spaces for…

math.GR2017★ 1 cited

Non-crossing partitions and Milnor fibers

Thomas Brady, Michael Falk, Colum Watt

For a finite real reflection group we use non-crossing partitions of type to construct finite cell complexes with the homotopy type of the Milnor fiber of the associated $W…

math.CO2010

Climbing elements in finite coxeter groups

Thomas Brady, Aisling Kenny, And Colum Watt

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 th…

math.CO2008★ 4 cited

From Permutahedron to Associahedron

Thomas Brady, Colum Watt

For each finite real reflection group , we identify a copy of the type- simplicial generalised associahedron inside the corresponding simplicial permutahedron. This defines a…

math.CO2006★ 2 cited

h-vectors of generalized associahedra and non-crossing partitions

Christos A. Athanasiadis, Thomas Brady, Jon McCammond +1

A case-free proof is given that the entries of the -vector of the cluster complex , associated by S. Fomin and A. Zelevinsky to a finite root system , count elements of…

math.CO2005

Shellability of noncrossing partition lattices

Christos A. Athanasiadis, Thomas Brady, Colum Watt

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…