Searcharxiv⌕ Search

arXiv subjects

Jon McCammond

Publications and source records attributed to Jon McCammond.

At least 37 records · Page 2Linked to original sources
arXiv2014

The infinite cyclohedron and its automorphism group

Cyclohedra are a well-known infinite familiy of finite-dimensional polytopes that can be constructed from centrally symmetric triangulations of even-sided polygons. In this article we introduce an infinite-dimensional analogue and prove that the group of symmetries of our construction is a semidirect product of a degree 2 central extension of Thompson's infinite finitely presented simple group T with the cyclic group of order 2. These results are inspired by a similar recent analysis by the first author of the automorphism group of an infinite-dimensional associahedron.

math.GR↗
arXiv2014

Braid groups and euclidean simplices

When Daan Krammer and Stephen Bigelow independently proved that braid groups are linear, they used the Lawrence-Krammer-Bigelow representation for generic values of its variables q and t. The t variable is closely connected to the traditional Garside structure of the braid group and plays a major role in Krammer's algebraic proof. The q variable, associated with the dual Garside structure of the braid group, has received less attention. In this article we give a geometric interpretation of the q portion of the LKB representation in terms of an action of the braid group on the space of non-degenerate euclidean simplices. In our interpretation, braid group elements act by systematically reshaping (and relabeling) euclidean simplices. The reshapings associated to the simple elements in the dual Garside structure of the braid group are of an especially elementary type that we call relabeling and rescaling.

math.GR↗
arXiv2013

Factoring euclidean isometries

Every isometry of a finite dimensional euclidean space is a product of reflections and the minimum length of a reflection factorization defines a metric on its full isometry group. In this article we identify the structure of intervals in this metric space by constructing, for each isometry, an explicit combinatorial model encoding all of its minimal length reflection factorizations. The model is largely independent of the isometry chosen in that it only depends on whether or not some point is fixed and the dimension of the space of directions that points are moved.

math.GR↗
arXiv2013

The structure of euclidean Artin groups

The Coxeter groups that act geometrically on euclidean space have long been classified and presentations for the irreducible ones are encoded in the well-known extended Dynkin diagrams. The corresponding Artin groups are called euclidean Artin groups and, despite what one might naively expect, most of them have remained fundamentally mysterious for more than forty years. Recently, my coauthors and I have resolved several long-standing conjectures about these groups, proving for the first time that every irreducible euclidean Artin group is a torsion-free centerless group with a decidable word problem and a finite-dimensional classifying space. This article surveys our results and the techniques we use to prove them.

math.GR↗
arXiv2013

The BNS-invariant for the pure braid groups

In 1987 Bieri, Neumann and Strebel introduced a geometric invariant for discrete groups. In this article we compute and explicitly describe the BNS-invariant for the pure braid groups.

math.GT↗
arXiv2011

Order Independence in Asynchronous Cellular Automata

A sequential dynamical system, or SDS, consists of an undirected graph Y, a vertex-indexed list of local functions F_Y, and a permutation pi of the vertex set (or more generally, a word w over the vertex set) that describes the order in which these local functions are to be applied. In this article we investigate the special case where Y is a circular graph with n vertices and all of the local functions are identical. The 256 possible local functions are known as Wolfram rules and the resulting sequential dynamical systems are called finite asynchronous elementary cellular automata, or ACAs, since they resemble classical elementary cellular automata, but with the important distinction that the vertex functions are applied sequentially rather than in parallel. An ACA is said to be pi-independent if the set of periodic states does not depend on the choice of pi, and our main result is that for all n>3 exactly 104 of the 256 Wolfram rules give rise to a pi-independent ACA. In 2005 Hansson, Mortveit and Reidys classified the 11 symmetric Wolfram rules with this property. In addition to reproving and extending this earlier result, our proofs of pi-independence also provide significant insight into the dynamics of these systems.

math.DS↗
arXiv2011

Dynamics Groups of Asynchronous Cellular Automata

We say that a finite asynchronous cellular automaton (or more generally, any sequential dynamical system) is pi-independent if its set of periodic points are independent of the order that the local functions are applied. In this case, the local functions permute the periodic points, and these permutations generate the dynamics group. We have previously shown that exactly 104 of the possible 256 cellular automaton rules are pi-independent. In this article, we classify the periodic states of these systems and describe their dynamics groups, which are quotients of Coxeter groups. The dynamics groups provide information about permissible dynamics as a function of update sequence and, as such, connect discrete dynamical systems, group theory, and algebraic combinatorics in a new and interesting way. We conclude with a discussion of numerous open problems and directions for future research.

math.DS↗
arXiv2011

Geometric Semigroup Theory

Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups and automata lead to simplifications of the graphs on which the corresponding finite semigroups act. We show in particular that every finite semigroup can be finitely expanded so that the expansion acts on a labeled directed graph which resembles the right Cayley graph of a free Burnside semigroup in many respects.

math.GR↗
arXiv2010

Bounding reflection length in an affine Coxeter group

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 element is called its reflection length. In this article we prove that the reflection length function on an affine Coxeter group has a uniform upper bound. More precisely we prove that the reflection length function on an affine Coxeter group that naturally acts faithfully and cocompactly on $\R^n$ is bounded above by $2n$ and we also show that this bound is optimal. Conjecturally, spherical and affine Coxeter groups are the only Coxeter groups with a uniform bound on reflection length.

math.CO↗
arXiv2009

Triangles, squares and geodesics

In the early 1990s Steve Gersten and Hamish Short proved that compact nonpositively curved triangle complexes have biautomatic fundamental groups and that compact nonpositively curved square complexes have biautomatic fundamental groups. In this article we report on the extent to which results such as these extend to nonpositively curved complexes built out a mixture of triangles and squares. Since both results by Gersten and Short have been generalized to higher dimensions, this can be viewed as a first step towards unifying Januszkiewicz and {Ś}wi{ȧ}tkowski's theory of simplicial nonpositive curvature with the theory of nonpositively curved cube complexes.

math.GR↗
arXiv2009

Windmills and extreme 2-cells

In this article we prove new results about the existence of 2-cells in disc diagrams which are extreme in the sense that they are attached to the rest of the diagram along a small connected portion of their boundary cycle. In particular, we establish conditions on a 2-complex X which imply that all minimal area disc diagrams over X with reduced boundary cycles have extreme 2-cells in this sense. The existence of extreme 2-cells in disc diagrams over these complexes leads to new results on coherence using the perimeter-reduction techniques we developed in an earlier article. Recall that a group is called coherent if all of its finitely generated subgroups are finitely presented. We illustrate this approach by showing that several classes of one-relator groups, small cancellation groups and groups with staggered presentations are collections of coherent groups.

math.GR↗
arXiv2009

Combinatorial descriptions of multi-vertex 2-complexes

Group presentations are implicit descriptions of 2-dimensional cell complexes with only one vertex. While such complexes are usually sufficient for topological investigations of groups, multi-vertex complexes are often preferable when the focus shifts to geometric considerations. In this article, I show how to quickly describe the most important multi-vertex 2-complexes using a slight variation of the traditional group presentation. As an illustration I describe multi-vertex 2-complexes for torus knot groups and one-relator Artin groups from which their elementary properties are easily derived. The latter are used to give an easy geometric proof of a classic result of Appel and Schupp.

math.GR↗
arXiv2009

Braids, posets and orthoschemes

In this article we study the curvature properties of the order complex of a graded poset under a metric that we call the ``orthoscheme metric''. In addition to other results, we characterize which rank 4 posets have CAT(0) orthoscheme complexes and by applying this theorem to standard posets and complexes associated with four-generator Artin groups, we are able to show that the 5-string braid group is the fundamental group of a compact nonpositively curved space.

math.GR↗
arXiv2009

The integral cohomology of the group of loops

Let PSigma_n denote the group that can be thought of either as the group of motions of the trivial n-component link or the group of symmetric automorphisms of a free group of rank n. The integral cohomology ring of PSigma_n is determined, establishing a conjecture of Brownstein and Lee.

math.AT↗
arXiv2006

Geometric presentations for the pure braid group

We give several new positive finite presentations for the pure braid group that are easy to remember and simple in form. All of our presentations involve a metric on the punctured disc so that the punctures are arranged "convexly", which is why we describe them as geometric presentaitons. Motivated by a presentation for the full braid group that we call the "rotation presentation", we introduce presentations for the pure braid group that we call the "twist presentation" and the "swing presentation". From the point of view of mapping class groups, the swing presentation can be interpreted as stating that the pure braid group is generated by a finite number of Dehn twists and that the only relations needed are the disjointness relation and the lantern relation.

math.GT↗
arXiv2006

h-vectors of generalized associahedra and non-crossing partitions

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 $Δ(Φ)$.

math.CO↗
arXiv2006

Noncrossing partitions in surprising locations

Certain mathematical structures make a habit of reoccuring in the most diverse list of settings. Some obvious examples exhibiting this intrusive type of behavior include the Fibonacci numbers, the Catalan numbers, the quaternions, and the modular group. In this article, the focus is on a lesser known example: the noncrossing partition lattice. The focus of the article is a gentle introduction to the lattice itself in three of its many guises: as a way to encode parking functions, as a key part of the foundations of noncommutative probability, and as a building block for a contractible space acted on by a braid group. Since this article is aimed primarily at nonspecialists, each area is briefly introduced along the way.

math.CO↗