49 citations · 164 across the 34 of their papers we have counts for
7 papers · 1 filter
Fixed Points of Parking Functions
Jon McCammond, Hugh Thomas, Nathan Williams
We define an action of words in on to give a new characterization of rational parking functions -- they are exactly those words whose action has a fixed poin…
Computing reflection length in an affine Coxeter group
Joel Brewster Lewis, Jon McCammond, T. Kyle Petersen +1
In any Coxeter group, the conjugates of elements in its Coxeter generating set are called reflections and the reflection length of an element is its length with respect to this exp…
Noncrossing hypertrees
Jon McCammond
Hypertrees and noncrossing trees are well-established objects in the combinatorics literature, but the hybrid notion of a noncrossing hypertree has received less attention. In this…
Undesired parking spaces and contractible pieces of the noncrossing partition link
Michael Dougherty, Jon McCammond
There are two natural simplicial complexes associated to the noncrossing partition lattice: the order complex of the full lattice and the order complex of the lattice with its boun…
Bounding reflection length in an affine Coxeter group
Jon McCammond, T. Kyle Petersen
In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular e…
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…