49 citations · 164 across the 34 of their papers we have counts for
37 papers
Geometric Combinatorics of Polynomials I: The Case of a Single Polynomial
Michael Dougherty, Jon McCammond
There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object t…
Factoring isometries of quadratic spaces into reflections
Jon McCammond, Giovanni Paolini
Let be a vector space endowed with a non-degenerate quadratic form . If the base field is different from , it is known that every isometry can be…
Critical Points, Critical Values, and a Determinant Identity for Complex Polynomials
Michael Dougherty, Jon McCammond
Given any n-tuple of complex numbers, one can canonically define a polynomial of degree n+1 that has the entries of this n-tuple as its critical points. In 2002, Beardon, Carne, an…
Connectivity at Infinity for the Braid Group of a Complete Bipartite Graph
Kristen Mazur, Jon McCammond, John Meier +1
The graph braid group of a complete bipartite graph is the fundamental group of a configuration space of points on the graph, which is a CAT(0) cube complex. We combine an analysis…
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…
Boundary Braids
Michael Dougherty, Jon McCammond, Stefan Witzel
The n-strand braid group can be defined as the fundamental group of the configuration space of n unlabeled points in a closed disk based at a configuration where all n points lie i…