English
Related papers

Related papers: Graph braid groups and right-angled Artin groups

200 papers

This paper focuses on tools for constructing 4-manifolds that have fundamental group $G$ isomorphic to a right-angled Artin group and that are also minimal, in the sense that they minimize $b_2(M)$, the dimension of $H_2(M;\mathbb{Q})$. For…

Geometric Topology · Mathematics 2016-01-20 Alyson Hildum

A graph is $(d_1, \ldots, d_k)$-colorable if its vertex set can be partitioned into $k$ nonempty subsets so that the subgraph induced by the $i$th part has maximum degree at most $d_i$ for each $i\in\{1, \ldots, k\}$. It is known that for…

Combinatorics · Mathematics 2019-08-09 Ilkyoo Choi , Gexin Yu , Xia Zhang

We first show that the braid group over a graph topologically containing no $\Theta$-shape subgraph has a presentation related only by commutators. Then using discrete Morse theory and triple Massey products, we prove that a graph…

Geometric Topology · Mathematics 2014-07-15 Ki Hyoung Ko , Joon Hyun La , Hyo Won Park

A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. Only…

Combinatorics · Mathematics 2021-02-11 Vinod Kumar , Krishnendra Shekhawat

We give a condition on the defining graph of a right-angled Artin group which implies its automorphism group is virtually indicable, that is, it has a finite-index subgroup that admits a homomorphism onto $\Z$. We use this as part of a…

Group Theory · Mathematics 2020-11-10 Andrew Sale

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge (and any pair of crossing edges cross only once). A non-1-planar graph $G$ is minimal if the graph $G-e$ is 1-planar for every…

Combinatorics · Mathematics 2011-10-24 Vladimir P. Korzhik , Bojan Mohar

Let $N$ be a closed nonorientable surface with or without marked points. In this paper we prove that, for every finite full subgraph $\Gamma$ of $\mathcal{C}^{\mathrm{two}}(N)$, the right-angled Artin group on $\Gamma$ can be embedded in…

Geometric Topology · Mathematics 2023-08-25 Takuya Katayama , Erika Kuno

We compute the relative divergence and the subgroup distortion of Bestvina-Brady subgroups. We also show that for each integer $n\geq 3$, there is a free subgroup of rank $n$ of some right-angled Artin group whose inclusion is not a…

Group Theory · Mathematics 2018-03-16 Hung Cong Tran

A generalization of the topological fundamental group is developed in order to exhibit a topologically complete braid group containing Artin's braid group on infinitely many strands with respect to the following notion of convergence: A…

Geometric Topology · Mathematics 2007-05-23 Paul Fabel

We show that if a right-angled Artin group $A(\Gamma)$ has a non-trivial, minimal action on a tree $T$ which is not a line, then $\Gamma$ contains a separating subgraph $\Lambda$ such that $A(\Lambda)$ stabilizes an edge in $T$.

Group Theory · Mathematics 2021-03-17 M. Hull

We give a monoidal presentation of Coxeter and braid 2-groups, in terms of decorated planar graphs. This presentation extends the Coxeter presentation. We deduce a simple criterion for a Coxeter group or braid group to act on a category.

Representation Theory · Mathematics 2017-01-11 Ben Elias , Geordie Williamson

In this paper we study topological invariants of a class of random groups. Namely, we study right angled Artin groups associated to random graphs and investigate their Betti numbers, cohomological dimension and topological complexity. The…

Algebraic Topology · Mathematics 2011-01-11 Armindo Costa , Michael Farber

A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of $G$ to a sequence of horizontal…

Computational Geometry · Computer Science 2022-05-17 Walter Didimo , Michael Kaufmann , Giuseppe Liotta , Giacomo Ortali

In this paper, we study the flexibility of two planar graph classes $\mathcal{H}_1$, $\mathcal{H}_2$, where $\mathcal{H}_1$, $\mathcal{H}_2$ denote the set of all hopper-free planar graphs and house-free planar graphs, respectively. Let $G$…

Combinatorics · Mathematics 2022-02-28 Fan Yang

By analyzing known presentations of the pure mapping groups of orientable surfaces of genus $g$ with $b$ boundary components and $n$ punctures, we show that these groups are isomorphic to some groups related to the braid groups and the…

Geometric Topology · Mathematics 2020-03-03 Ignat Soroko

For a finite simplicial graph $\Gamma$, let $A(\Gamma)$ denote the right-angled Artin group on $\Gamma$. Recently Kim and Koberda introduced the extension graph $\Gamma^e$ for $\Gamma$, and established the Extension Graph Theorem: for…

Geometric Topology · Mathematics 2018-07-03 Eon-Kyung Lee , Sang-Jin Lee

The present article continues the study of median groups initiated in [6, 9, 10]. Some classes of median groups are introduced and investigated with a stress upon the class of the so called A-groups which contains as remarkable subclasses…

Group Theory · Mathematics 2009-09-23 Şerban A. Basarab

We study tropically planar graphs, which are the graphs that appear in smooth tropical plane curves. We develop necessary conditions for graphs to be tropically planar, and compute the number of tropically planar graphs up to genus $7$. We…

Algebraic Geometry · Mathematics 2020-02-06 Desmond Coles , Neelav Dutta , Sifan Jiang , Ralph Morrison , Andrew Scharf

An orientation of a graph $G$ is proper if any two adjacent vertices have different indegrees. The proper orientation number $\overrightarrow{\chi}(G)$ of a graph $G$ is the minimum of the maximum indegree, taken over all proper…

We design an algorithm writing down presentations of graph braid groups. Generators are represented in terms of actual motions of robots moving without collisions on a given graph. A key ingredient is a new motion planning algorithm whose…

Geometric Topology · Mathematics 2009-08-10 V. Kurlin