English
Related papers

Related papers: Embedding right-angled Artin groups into graph bra…

200 papers

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

We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…

Mathematical Physics · Physics 2021-05-12 Byung Hee An , Tomasz Maciazek

We take the fundamental group of the complement of the branch curve of a generic projection induced from canonical embedding of a surface. This group is stable on connected components of moduli spaces of surfaces. Since for many classes of…

Algebraic Geometry · Mathematics 2007-05-23 Mina Teicher

A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…

Computational Geometry · Computer Science 2017-01-26 Ioannis Z. Emiris , Ioannis Psarros

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

While finite type Artin groups and right-angled Artin groups are well-understood, little is known about more general Artin groups. In this paper we use the action of an infinite type Artin group $A_\Gamma$ on a CAT(0) cube complex to prove…

Group Theory · Mathematics 2018-06-04 Ruth Charney , Rose Morris-Wright

From a group $H$ and a non-trivial element $h$ of $H$, we define a representation $\rho: B_n \to \Aut(G)$, where $B_n$ denotes the braid group on $n$ strands, and $G$ denotes the free product of $n$ copies of $H$. Such a representation…

Group Theory · Mathematics 2007-05-23 John Crisp , Luis Paris

The aim of the present note is to construct invariants of the Artin braid group valued in $G_{N}^{2}$, and further study of groups related to $G_{n}^{3}$. In the groups $G_{n}^{2}$, the word problem is solved; these groups are much simpler…

Geometric Topology · Mathematics 2016-12-02 Vassily Olegovich Manturov

Given a knot or link in the handlebody, $H_g$, of genus $g$ we prove that it can always be represented as the plat closure of a braid in $H_g$. We further establish the Hilden braid group for the handlebody, as a subgroup of the mixed braid…

Geometric Topology · Mathematics 2023-12-19 Paolo Cavicchioli , Sofia Lambropoulou

We show that non-abelian two-generator subgroups of right-angled Artin groups are quasi-isometrically embedded free groups. This provides an alternate proof of a theorem of A. Baudisch: that all two-generator subgroups are free or free…

Group Theory · Mathematics 2015-10-14 Mike Carr

We are concerned with orderable groups and particularly those with orderings invariant not only under multiplication, but also under a given automorphism or family of automorphisms. Several applications to topology are given: we prove that…

Group Theory · Mathematics 2014-10-01 Dale Rolfsen , Bert Wiest

Braid groups are an important and flexible tool used in several areas of science, such as Knot Theory (Alexander's theorem), Mathematical Physics (Yang-Baxter's equation) and Algebraic Geometry (monodromy invariants). In this note we will…

Algebraic Geometry · Mathematics 2019-05-10 Francesco Polizzi

For any fixed surface Sigma of genus g, we give an algorithm to decide whether a graph G of girth at least five embedded in Sigma is colorable from an assignment of lists of size three in time O(|V(G)|). Furthermore, we can allow a subgraph…

Data Structures and Algorithms · Computer Science 2012-10-30 Zdenek Dvorak , Ken-ichi Kawarabayashi

We construct examples of free-by-cyclic hyperbolic groups which fiber in infinitely many ways over Z. The construction involves adding a specialized square 2-cell to a non-positively curved, squared 2-complex defined by labeled oriented…

Group Theory · Mathematics 2014-11-11 TaraLee Mecham , Antara Mukherjee

A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…

Combinatorics · Mathematics 2020-01-28 Richard Leyland

We characterize, in terms of the defining graph, when a twisted right-angled Artin group (a group whose only relations among pairs of generators are either commuting or Klein-bottle type relations) is left-orderable.

Group Theory · Mathematics 2024-10-28 Yago Antolín , Martín Blufstein , Luis Paris

Each restriction semigroup is proved to be embeddable in a factorisable restriction monoid, or, equivalently, in an almost factorisable restriction semigroup. It is also established that each restriction semigroup has a proper cover which…

Rings and Algebras · Mathematics 2018-09-19 Victoria Gould , Miklos Hartmann , Maria Szendrei

We show that the fundamental groups of any two closed irreducible non-geometric graph-manifolds are quasi-isometric. This answers a question of Kapovich and Leeb. We also classify the quasi-isometry types of fundamental groups of…

Geometric Topology · Mathematics 2010-04-13 Jason A. Behrstock , Walter D. Neumann

A graph product kernel means the kernel of the natural surjection from a graph product to the corresponding direct product. We prove that a graph product kernel of countable groups is special, and a graph product of finite or cyclic groups…

Group Theory · Mathematics 2012-05-17 Sang-hyun Kim

The Bandwidth Theorem of B\"ottcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this…

Combinatorics · Mathematics 2013-05-10 Julia Böttcher , Anusch Taraz , Andreas Würfl
‹ Prev 1 4 5 6 7 8 10 Next ›