English
Related papers

Related papers: Stallings graphs for quasi-convex subgroups

200 papers

This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…

Logic · Mathematics 2008-09-22 Bakhadyr Khoussainov , Jiamou Liu , Mia Minnes

Vertex-stabilizers of trivalent edge-transitive graphs have been classified by Tutte, Goldschmidt and some others in several previous papers. Tetravalent half-arc-transitive graphs form an important class of tetravalent edge-transitive…

Combinatorics · Mathematics 2025-09-01 Jin-Xin Zhou

We define several "standard" subgroups of the automorphism group Aut(G) of a partially commutative (right-angled Artin) group and use these standard subgroups to describe decompositions of Aut(G). If C is the commutation graph of G, we show…

Group Theory · Mathematics 2012-11-14 Andrew J. Duncan , Vladimir N. Remeslennikov

Let $G$ and $G'$ be two right-angled Artin groups (RAAG). We show they are quasi-isometric iff they are isomorphic, under the assumption that $Out(G)$ and $Out(G')$ are finite. If only $Out(G)$ is finite, then $G'$ is quasi-isometric $G$…

Group Theory · Mathematics 2018-03-16 Jingyin Huang

Relatively little is known about the discrete horospheres in hyperbolic groups, even in simple settings. In this paper we work with hyperbolic one-ended right-angled Coxeter groups and describe two graph structures that mimic the intrinsic…

Metric Geometry · Mathematics 2025-09-01 Noah Jillson , Daniel N. Levitin , Pramana Saldin , Katerina Stuopis , Qianruixi Wang , Kaicheng Xue

We introduce a topological property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define…

Group Theory · Mathematics 2014-10-10 Mark Brittenham , Susan Hermiller

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

Group Theory · Mathematics 2016-05-18 Michael Giudici , Bojan Kuzma

Wise's Quasiconvex Hierarchy Theorem classifying hyperbolic virtually compact special groups in terms of quasiconvex hierarchies played an essential role in Agol's proof of the Virtual Haken Conjecture. Answering a question of Wise, we…

Group Theory · Mathematics 2025-11-26 Eduard Einstein

It is shown that the middle quasi-homomorphisms of Fujiwara and Kapovich are precisely constant perturbations of quasi-homomorphisms. Quasi-polynomial maps are defined and their constructibility is explored. In particular, it is shown that…

Group Theory · Mathematics 2025-06-03 Primoz Moravec

We compute the automorphism group of the intersection graph of many large-type Artin groups. This graph is an analogue of the curve graph of mapping class groups but in the context of Artin groups. As an application, we deduce a number of…

Group Theory · Mathematics 2024-07-30 Jingyin Huang , Damian Osajda , Nicolas Vaskou

We show that if a group is not virtually cyclic and is hyperbolic relative to a family of proper subgroups, then it has a hyperbolically embedded subgroup which contains a finitely generated non-abelian free group as a finite index…

Group Theory · Mathematics 2012-05-23 Yoshifumi Matsuda , Shin-ichi Oguni , Saeko Yamagata

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

Group Theory · Mathematics 2026-05-14 Joseph Paul MacManus

We introduce a combinatorial version of Stallings-Bestvina-Feighn-Dunwoody folding sequences. We then show how they are useful in analyzing the solvability of the uniform subgroup membership problem for fundamental groups of graphs of…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Richard Weidmann , Alexei Myasnikov

We generalize to (certain) Artin groups some results previously known for right-angled Artin groups (RAAGs). First, we generalize a result by Droms, B. Servatius, and H. Servatius, and prove that the derived subgroup of an Artin group is…

Group Theory · Mathematics 2025-04-14 Jone Lopez de Gamiz Zearra , Conchita Martínez Pérez

In the vein of Bonfert-Taylor, Bridgeman, Canary, and Taylor we introduce the notion of quasiconformal homogeneity for closed oriented hyperbolic surfaces restricted to subgroups of the mapping class group. We find uniform lower bounds for…

Geometric Topology · Mathematics 2024-03-11 Nicholas G. Vlamis

In this article, we generalise Haglund and Wise's theory of special cube complexes to groups acting on quasi-median graphs. More precisely, we define special actions on quasi-median graphs, and we show that a group which acts specially on a…

Group Theory · Mathematics 2020-02-06 Anthony Genevois

Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…

Group Theory · Mathematics 2007-07-03 Andrew J Duncan , Ilya V Kazachkov , Vladimir N Remeslennikov

In this short note, we prove the existence of weakly malnormal, virtually free, quasiconvex subgroups in any nonelementary hyperbolic group. This extends a result of Ilya Kapovich, where he proved the existence of malnormal quasiconvex…

Group Theory · Mathematics 2025-06-26 Rakesh Halder , Pranab Sardar

The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…

Group Theory · Mathematics 2008-03-17 Andrew J. Duncan , Ilya V. Kazachkov , Vladimir N. Remeslennikov

We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…

Combinatorics · Mathematics 2014-05-28 Svante Janson , Vera T. Sós