Related papers: A simple solution to the word problem for virtual …

In this paper we define a monoid of pseudo braids and prove that this monoid is isomorphic to a singular braid monoid. We also prove an analogue of Markov's theorem for pseudo braids.

We present a survey of results on word equations in simple groups, as well as their analogues and generalizations, which were obtained over the past decade using various methods, group-theoretic and coming from algebraic and arithmetic…

In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…

We study the codegree isomorphism problem for finite simple groups. In particular, we show that such a group is determined by the codegrees (counting multiplicity) of its irreducible characters. The proof is uniform for all simple groups…

Virtual knot theory has experienced a lot of nice features that did not appear in classical knot theory, e.g., parity and picture-valued invariants. In the present paper we use virtual knot theory effects to construct new representations of…

We study the representations of the commutator subgroup of the braid group with n strands in the symmetric group of degree r. Motivated by some experimental results, we conjecture that for n>r, every such representation is trivial.

In this paper we investigate the word problem of the free Burnside semigroup satisfying x^2=x^3 and having two generators. Elements of this semigroup are classes of equivalent words. A natural way to solve the word problem is to select a…

Finite type invariants (also known as Vassiliev invariants) of pure braids are considered from a group-theoretic point of view. New results include a construction of a universal invariant with integer coefficients based on the Magnus…

In this paper, we bring a complete solution to the Ovals problem, as formulated in [3] and [24].

We consider several classes of knotted objects, namely usual, virtual and welded pure braids and string links, and two equivalence relations on those objects, induced by either self-crossing changes or self-virtualizations. We provide a…

We prove that the width of any word in a simply connected Chevalley group of rank at least 2 over the ring that is a localisation of the ring of integers in a number field is bounded by a constant that depends only on the root system and on…

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…

We introduce a recoupling theory for virtual braided trees. This recoupling theory can be utilized to incorporate swap gates into anyonic models of quantum computation.

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

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…

It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed…

Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…

We show that braid varieties for any complex simple algebraic group $G$ are cluster varieties. This includes open Richardson varieties inside the flag variety $G/B$.

We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…

Let $\Gamma$ be a Coxeter graph, let $(W,S)$ be its associated Coxeter system, and let $(A,\Sigma$) be its associated Artin-Tits system. We regard $W$ as a reflection group acting on a real vector space $V$. Let $I$ be the Tits cone, and…