Related papers: Systolic complexes and group presentations
The simplicial complexity is an invariant for finitely presentable groups that was recently introduced by Babenko, Balacheff and Bulteau to study systolic area. The simplicial complexity $\kappa(G)$ was proved to be a good approximation of…
A cyclic presentation of a group is a presentation with an equal number of generators and relators that admits a particular cyclic symmetry. We characterise the orientable, non-orientable, and redundant cyclic presentations and obtain…
A finitely presented group is weakly geometrically simply connected (wgsc) if it is the fundamental group of some compact polyhedron whose universal covering is wgsc i.e. it has an exhaustion by compact connected and simply connected…
We introduce the notion of weakly systolic complexes and groups, and initiate regular studies of them. Those are simplicial complexes with nonpositive-curvature-like properties and groups acting on them geometrically. We characterize weakly…
We generalise the standard constructions of a Cayley graph in terms of a group presentation by allowing some vertices to obey different relators than others. The resulting notion of presentation allows us to represent every vertex…
In this article we study combinatorial non-positive curvature aspects of various simplicial complexes with natural $\widetilde A_n$ shaped simplicies, including Euclidean buildings of type $\widetilde A_n$ and Cayley graphs of Garside…
A common feature of Coxeter groups and right-angled Artin groups is their solution to the word problem. Matthew Dyer introduced a class of groups, which we call Dyer groups, sharing this feature. This class includes, but is not limited to,…
We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…
We extend previous results by Cumplido, Martin and Vaskou on parabolic subgroups of large-type Artin groups to a broader family of two-dimensional Artin groups. In particular, we prove that an arbitrary intersection of parabolic subgroups…
We prove that each nonpositively curved square VH-complex can be turned functorially into a locally 6-large simplicial complex of the same homotopy type. It follows that any group acting geometrically on a CAT(0) square VH-complex is…
We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.
Garside theory emerged from the study of Artin groups and their generalizations. Finite-type Artin groups admit two types of interval Garside structures corresponding to their standard and dual presentations. Concerning affine Artin groups,…
We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…
The irreducible euclidean Coxeter groups that naturally act geometrically on euclidean space are classified by the well-known extended Dynkin diagrams and these diagrams also encode the modified presentations that define the irreducible…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
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…
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…
A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show…
We define a family of graphs we call dual systolic graphs. This definition comes from graphs that are duals of systolic simplicial complexes. Our main result is a sharp (up to constants) isoperimetric inequality for dual systolic graphs.…
An even Artin group is a group which has a presentation with relations of the form $(st)^n=(ts)^n$ with $n\ge 1$. With a group $G$ we associate a Lie $\mathbb Z$-algebra $\mathcal{TG}r(G)$. This is the usual Lie algebra defined from the…