English
Related papers

Related papers: Artin HNN-extensions virtually embed in Artin grou…

200 papers

One can observe that Coxeter groups and right-angled Artin groups share the same solution to the word problem. On the other hand, in his study of reflection subgroups of Coxeter groups Dyer introduces a family of groups, which we call Dyer…

Group Theory · Mathematics 2022-12-22 Luis Paris , Mireille Soergel

We show that for a sufficiently simple surface $S$, a right-angled Artin group $A(\Gamma)$ embeds into $\Mod(S)$ if and only if $\Gamma$ embeds into the curve graph $\mC(S)$ as an induced subgraph. When $S$ is sufficiently complicated,…

Geometric Topology · Mathematics 2014-05-26 Sang-hyun Kim , Thomas Koberda

In this paper, we show that affine extensions of non-crystallographic Coxeter groups can be derived via Coxeter-Dynkin diagram foldings and projections of affine extended versions of the root systems E_8, D_6 and A_4. We show that the…

Mathematical Physics · Physics 2013-10-22 Pierre-Philippe Dechant , Celine Boehm , Reidun Twarock

We show that every graph product of finitely generated abelian groups acts properly and cocompactly on a CAT(0) cubical complex. The complex generalizes (up to subdivision) the Salvetti complex of a right-angled Artin group and the Coxeter…

Group Theory · Mathematics 2017-05-18 Kim Ruane , Stefan Witzel

The mixed braid groups are the subgroups of Artin braid groups whose elements preserve a given partition of the base points. We prove that the centralizer of any braid can be expressed in terms of semidirect and direct products of mixed…

Geometric Topology · Mathematics 2007-05-23 Juan Gonzalez-Meneses , Bert Wiest

We study the profinite genus of HNN-extensions whose associated subgroups are finite. We give precise formulas for the number of isomorphism classes of HNN(G,H,K,t,f) and of its profinite completion and compute the profinite genus of such…

Group Theory · Mathematics 2026-01-16 V. R. de Bessa , A. L. P. Porto , P. A. Zalesskii

This article resolves several long-standing conjectures about Artin groups of euclidean type. In particular, we prove that every irreducible euclidean Artin group is a torsion-free centerless group with a decidable word problem and a…

Group Theory · Mathematics 2017-07-21 Jon McCammond , Robert Sulway

We prove that the Center Conjecture passes to the Artin groups whose defining graphs are cones, if the conjecture holds for the Artin group defined on the set of the cone points. In particular, it holds for every Artin group whose defining…

Group Theory · Mathematics 2025-02-26 Kasia Jankiewicz , MurphyKate Montee

In this paper we consider the class of 2-dimensional Artin groups with connected, large type, triangle-free defining graphs (type CLTTF). We classify these groups up to isomorphism, and describe a generating set for the automorphism group…

Group Theory · Mathematics 2014-11-11 John Crisp

We prove the Tits Alternative for groups acting on $2$-dimensional "recurrent" complexes with uniformly bounded cell stabilisers. This class of complexes includes, among others: $2$-dimensional Euclidean buildings, $2$-dimensional systolic…

Group Theory · Mathematics 2021-07-26 Damian Osajda , Piotr Przytycki

A double Ore extension is a natural generalization of the Ore extension. We prove that a connected graded double Ore extension of an Artin-Schelter regular algebra is Artin-Schelter regular. Some other basic properties such as the…

Rings and Algebras · Mathematics 2007-12-18 James J. Zhang , Jun Zhang

Semistability at infinity is an asymptotic property of finitely presented groups that is needed in order to effectively define the fundamental group at infinity for a 1-ended group. It is an open problem whether or not all finitely…

Group Theory · Mathematics 2022-06-10 Michael Mihalik

We prove that for any infinite right-angled Coxeter or Artin group, its spherical and geodesic growth rates (with respect to the standard generating set) either take values in the set of Perron numbers, or equal $1$. Also, we compute the…

Group Theory · Mathematics 2019-11-26 Alexander Kolpakov , Alexey Talambutsa

We describe Artin's braid group on a (fixed) finite number of strings as a crossed module over itself. In particular, we interpret the braid relations as crossed module structure relations.

Algebraic Topology · Mathematics 2013-03-12 Johannes Huebschmann

We introduce the annex of an element $x$ in a Coxeter group as the set of elements $y$ such that $x \nleq y$ with respect to Bruhat order. This notion provides a complementary perspective to the study of Bruhat intervals and their…

Group Theory · Mathematics 2026-03-17 Megan Masters

This thesis takes Brady's construction of $K(\pi,1)$s for the braid groups as a starting point. It is widely known that this construction can - with the right ingredients - be generalized to Artin groups of finite type. Results of Bessis as…

Group Theory · Mathematics 2018-10-08 Valentin Braun

Consider the mapping class group $\Mod_{g,p}$ of a surface $\Sigma_{g,p}$ of genus $g$ with $p$ punctures, and a finite collection $\{f_1,...,f_k\}$ of mapping classes, each of which is either a Dehn twist about a simple closed curve or a…

Geometric Topology · Mathematics 2012-03-23 Thomas Koberda

We describe an algorithm to identify a minimal set of "braid relations" which span and preserve all sets of involution words for twisted Coxeter systems of finite or affine type. We classify the cases in which adding the smallest possible…

Combinatorics · Mathematics 2017-11-22 Eric Marberg

We investigate criteria ensuring that a one-relator group $G$ contains a right-angled Artin subgroup $A(\Gamma)$, corresponding to a finite graph $\Gamma$. In particular, we prove that if $\Gamma$ is a forest with at least one edge and the…

Group Theory · Mathematics 2025-08-01 Ashot Minasyan , Motiejus Valiunas

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…

Combinatorics · Mathematics 2010-10-25 Jon McCammond , T. Kyle Petersen