English
Related papers

Related papers: Embeddings of right-angled Artin groups

200 papers

We demonstrate that the submonoid membership problem and the rational subset membership problem are equivalent in Artin groups. Both these problem are undecidable in a given Artin group if and only if the group embeds the right-angled Artin…

Group Theory · Mathematics 2024-09-27 Islam Foniqi

In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…

Group Theory · Mathematics 2023-10-18 V. H. Mikaelian

We determine the factorial growth rate of the number of finite index subgroups of right-angled Artin groups as a function of the index. This turns out to depend solely on the independence number of the defining graph. We also make a…

Group Theory · Mathematics 2019-09-11 Hyungryul Baik , Bram Petri , Jean Raimbault

We show several geometric and algebraic aspects of a necklace: a link composed with a core circle and a series of circles linked to this core. We first prove that the fundamental group of the configuration space of necklaces (that we will…

Group Theory · Mathematics 2018-10-30 Paolo Bellingeri , Arnaud Bodin

The virtual braid groups are generalizations of the classical braid groups. This paper gives an elementary proof that the classical braid group injects into the virtual braid group over the same number of strands.

Geometric Topology · Mathematics 2020-08-25 Robin Gaudreau

In this paper we will present the results of Artin--Markov on braid groups by using the Groebner--Shirshov basis. As a consequence we can reobtain the normal form of Artin--Markov--Ivanovsky as an easy corollary.

Group Theory · Mathematics 2008-06-09 L. A. Bokut , V. V. Chaynikov , K. P. Shum

Recent research of the author has given an explicit geometric description of free (two-sided) adequate semigroups and monoids, as sets of labelled directed trees under a natural combinatorial multiplication. In this paper we show that there…

Rings and Algebras · Mathematics 2009-05-08 Mark Kambites

We find a condition on the underlying graph of an Artin group that fully determines if it is subgroup separable. As a consequence, an Artin group is subgroup separable if and only if it can be obtained from Artin groups of ranks at most 2…

Group Theory · Mathematics 2021-05-10 Kisnney Almeida , Igor Lima

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

It has long been known that the combinatorial properties of a graph $\Gamma$ are closely related to the group theoretic properties of its right angled artin group (raag). It's natural to ask if the graph homomorphisms are similarly related…

Group Theory · Mathematics 2025-09-24 Chris Grossack

We derive functional relationships between spherical generating functions of graph monoids, right-angled Artin groups and right-angled Coxeter groups. We use these relationships to express the spherical generating function of a right-angled…

Group Theory · Mathematics 2014-09-16 Jayadev S. Athreya , Amritanshu Prasad

The goal of this paper is to construct examples of centralizers in the Artin braid groups requiring the number of generators quadratic in the number of strings. These examples disprove a recent conjecture of N. Franco and J.…

Geometric Topology · Mathematics 2007-05-23 Nikolai V. Ivanov

We construct and study polyhedral product models for classifying spaces of right-angled Artin and Coxeter groups, general graph product groups and their commutator subgroups. By way of application, we give a criterion of freeness for the…

Group Theory · Mathematics 2017-03-21 Taras Panov , Yakov Veryovkin

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 consider braids on $m+n$ strands, such that the first $m$ strands are trivially fixed. We denote the set of all such braids by $B_{m,n}$. Via concatenation $B_{m,n}$ acquires a group structure. The objective of this paper is to find a…

Geometric Topology · Mathematics 2016-09-07 Sofia Lambropoulou

Dehornoy showed that the Artin braid groups $B_n$ are left-orderable. This ordering is discrete, but we show that, for $n >2$ the Dehornoy ordering, when restricted to certain natural subgroups, becomes a dense ordering. Among subgroups…

Group Theory · Mathematics 2007-05-23 Adam Clay , Dale Rolfsen

In this paper, we investigate the structure of associated groups of symmetric quandles. Among other results, we explore the relationship between the associated group of a symmetric quandle and that of its underlying quandle. We provide a…

Geometric Topology · Mathematics 2025-08-12 Toshiyuki Akita , Kakeru Shikata

In this paper, we construct an implementable algorithm which solves the conjugacy problem in twisted right-angled Artin groups (T-RAAGs). In certain cases, the complexity is known to be linear, by reducing the problem to the twisted…

Group Theory · Mathematics 2025-09-25 Gemma Crowe , Islam Foniqi

In this note we study embeddings of Cayley graphs of right groups on surfaces. We characterize those right groups which have a toroidal but no planar Cayley graph, such that the generating system of the right group has a minimal generating…

Combinatorics · Mathematics 2009-07-31 Kolja Knauer , Ulrich Knauer

A near-group category is an additively semisimple category with a product such that all but one of the simple objects is invertible. We classify braided structures on near-group categories, and give explicit numerical formulas for their…

Quantum Algebra · Mathematics 2007-05-23 Jacob A. Siehler