English
Related papers

Related papers: Embedability between right-angled Artin groups

200 papers

In this article, we prove that, given two finite connected graphs $\Gamma_1$ and $\Gamma_2$, if the two right-angled Artin groups $A(\Gamma_1)$ and $A(\Gamma_2)$ are quasi-isometric, then the infinite pointed sums $\bigvee_\mathbb{N}…

Group Theory · Mathematics 2025-03-12 Carolyn Abbott , Anthony Genevois , Eduardo Martinez-Pedroza

A {\em net} is a graph consisting of a triangle $C$ and three more vertices, each of degree one and with its neighbour in $C$, and all adjacent to different vertices of $C$. We give a polynomial-time algorithm to test whether an input graph…

Discrete Mathematics · Computer Science 2020-12-01 Maria Chudnovsky , Paul Seymour , Nicolas Trotignon

We show that a large class of right-angled Artin groups (in particular, those with planar complementary defining graph) can be embedded quasi-isometrically in pure braid groups and in the group of area preserving diffeomorphisms of the disk…

Geometric Topology · Mathematics 2016-09-07 John Crisp , Bert Wiest

A graph $G$ realizes the degree sequence $S$ if the degrees of its vertices is $S$. Hakimi gave a necessary and sufficient condition to guarantee that there exists a connected multigraph realizing $S$. Taylor later proved that any connected…

Discrete Mathematics · Computer Science 2018-09-17 Nicolas Bousquet , Arnaud Mary

We show that in any right-angled Artin group whose defining graph has chromatic number $k$, every non-trivial element has stable commutator length at least $1/(6k)$. Secondly, if the defining graph does not contain triangles, then every…

Group Theory · Mathematics 2020-03-03 Max Forester , Ignat Soroko , Jing Tao

Aboulker, Adler, Kim, Sintiari, and Trotignon conjectured that every graph with bounded maximum degree and large treewidth must contain, as an induced subgraph, a large subdivided wall, or the line graph of a large subdivided wall. This…

Combinatorics · Mathematics 2022-05-19 Bogdan Alecu , Maria Chudnovsky , Kristina Vušković

In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…

Group Theory · Mathematics 2021-06-10 Matteo Cavaleri , Daniele D'Angeli , Alfredo Donno , Emanuele Rodaro

We study embeddings of a graph $G$ in a surface $S$ by considering representatives of different classes of $H_1(S)$ and their intersections. We construct a matrix invariant that can be used to detect homological invariance of elements of…

Combinatorics · Mathematics 2015-01-07 Steven Schluchter

A \emph{self-complementary} graph is a graph isomorphic to its complement. An isomorphism between $G$ and its complement, viewed as a permutation of $V(G)$, is then called an \emph{antimorphism}. A \emph{skew partition} of $G$ is a…

Combinatorics · Mathematics 2013-08-29 Nicolas Trotignon

We study a specific line arrangement obtained from a generic $2$-section of the braid arrangement, and compute the fundamental group of its complement via braid monodromy. We show that the resulting presentation of the fundamental group…

Geometric Topology · Mathematics 2026-01-06 So Yamagata

We prove that a parabolic subgroup $P$ contained in another parabolic subgroup $P'$ of an Artin group $A$ is a parabolic subgroup of $P'$. This answers a question of Godelle which is not obvious despite appearances. In order to achieve our…

Group Theory · Mathematics 2022-09-21 Martin Axel Blufstein , Luis Paris

An Artin HNN-extension is an HNN-extension of an Artin group in which the stable letter conjugates a pair of suitably chosen subsets of the standard generating set. We show that some finite index subgroup of an Artin HNN-extension embeds in…

Group Theory · Mathematics 2014-02-26 Tim Hsu , Ian J. Leary

The present paper constructs unbounded quasimorphisms that are invariant under all automorphisms on free products of more than two factors and on graph products of finitely generated abelian groups. This includes many classes of right…

Group Theory · Mathematics 2021-08-24 Bastien Karlhofer

We provide a complete description of the presentations of the interval groups related to quasi-Coxeter elements in finite Coxeter groups. In the simply laced cases, we show that each interval group is the quotient of the Artin group…

Group Theory · Mathematics 2022-11-28 Barbara Baumeister , Derek F. Holt , Georges Neaime , Sarah Rees

Chordal graphs are the graphs in which every cycle of length at least four has a chord. A set $S$ is a vertex separator for vertices $a$ and $b$ if the removal of $S$ of the graph separates $a$ and $b$ into distinct connected components. A…

Discrete Mathematics · Computer Science 2018-03-22 Sérgio H. Nogueira , Vinicius F. dos Santos

Charney and Morris-Wright showed acylindrical hyperbolicity of Artin groups of infinite type associated with graphs that are not joins, by studying clique-cube complexes and the actions on them. The authors developed their study and…

Group Theory · Mathematics 2025-06-26 Motoko Kato , Shin-ichi Oguni

For \math{p\ge 1}, we prove that every forest with \math{p} trees whose sizes are $a_1,..., a_p$ can be embedded in any graph containing at least $\sum_{i=1}^p (a_i + 1)$ vertices and having a minimum degree at least $\sum_{i=1}^p a_i$.

Combinatorics · Mathematics 2010-11-18 Mark Goldberg , Malik Magdon-Ismail

We show that a cubic graph $G$ of order $n$ has an induced $2$-regular subgraph of order at least a) $\frac{n-2}{4-\frac{4}{k}}$, if $G$ has no induced cycle of length more than $k$, b) $\frac{5n+6}{8}$, if $G$ has no induced cycle of…

Combinatorics · Mathematics 2014-06-11 Michael A. Henning , Felix Joos , Christian Löwenstein , Dieter Rautenbach

We show that many $2$-dimensional Artin groups are residually finite. This includes $3$-generator Artin groups with labels $\geq 4$ except for $(2m+1, 4,4)$ for any $m\geq 2$. As a first step towards residual finiteness we show that these…

Group Theory · Mathematics 2022-05-10 Kasia Jankiewicz

Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a…

Applications · Statistics 2021-06-23 Shangsi Wang , Jesús Arroyo , Joshua T. Vogelstein , Carey E. Priebe
‹ Prev 1 8 9 10 Next ›