Related papers: Membership problems in braid groups and Artin grou…
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…
We show that the problem of constructing a real rational knot of a reasonably low degree can be reduced to an algebraic problem involving the pure braid group: expressing an associated element of the pure braid group in terms of the…
Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside's weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the…
Let $M$ be the disk or a compact, connected surface without boundary different from the sphere $S^2$ and the real projective plane $\mathbb{R}P^2$, and let $N$ be a compact, connected surface (possibly with boundary). It is known that the…
Define a Garside monoid to be a cancellative monoid where right and left lcm's exist and that satisfy additional finiteness assumptions, and a Garside group to be the group of fractions of a Garside monoid. The family of Garside groups…
We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…
We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…
This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second…
Let M be a compact, connected surface, possibly with a finite set of points removed from its interior. Let d,n be positive integers, and let N be a d-fold covering space of M. We show that the covering map induces an embedding of the n-th…
Braid groups and mapping class groups have many features in common. Similarly to the notion of inverse braid monoid inverse mapping class monoid is defined. It concerns surfaces with punctures, but among given $n$ punctures several can be…
By introducing branching conditions on the defining graph, we prove a range of rigidity results for quasiisometric embeddings between right-angled Artin groups. The starting point for these is that, under mild conditions on the codomain,…
Groups acting freely on Z^n-trees (Z^n-free groups) play a key role in the study of non-archimedean group actions. Following Stallings' ideas, we develop graph-theoretic techniques to investigate subgroup structure of Z^n-free groups. As an…
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…
For every $n\geq 1$, the flat braid group $\mathrm{FB}_n$ is an analogue of the braid group $B_n$ that can be described as the fundamental group of the configuration space $$\left\{ \{x_1, \ldots, x_n \} \in \mathbb{R}^n / \mathrm{Sym}(n)…
We define pseudo-Garside groups and prove a theorem about them parallel to Garside's result on the word problem for the usual braid groups. The main novelty is that the set of simple elements can be infinite. We introduce a group B=B(Z^n)…
Since the braid group was discovered by E. Artin, the question of its conjugacy problem has been solved by Garside and Birman, Ko and Lee. However, the solutions given thus far are difficult to compute with a computer, since the number of…
In this article we study the right-angled Artin subgroups of a given right-angled Artin group. Starting with a graph $\gam$, we produce a new graph through a purely combinatorial procedure, and call it the extension graph $\gam^e$ of…
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…
We define invariants of braids rather than invariants of conjugacy classes of braids. For any pure three-braid we give effective upper and lower bounds for these invariants. This is done in terms of a natural syllable decomposition of the…
We introduce the universal virtual braid group $UV_n(c)$, which provides a unified algebraic framework for virtual braid--type structures with $c$ types of crossings and admits natural quotient maps onto the standard families in the…