Related papers: Algorithmic Problems in the Braid Group

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…

Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function.…

Algorithmic solutions to the conjugacy problem in the braid groups B_n were given by Elrifai-Morton in 1994 and by the authors in 1998. Both solutions yield two conjugacy class invariants which are known as `inf' and `sup'. A problem which…

The theory of Engel groups plays an important role in group theory since these groups are closely related to the Burnside problems. In this survey we consider several classical and novel algorithmic problems for Engel groups and propose…

In this second paper we solve the twisted conjugacy problem for even dihedral Artin groups, that is, groups with presentation $G(m) = \langle a,b \mid {}_{m}(a,b) = {}_{m}(b,a) \rangle$, where $m \geq 2$ is even, and $_{m}(a,b)$ is the word…

In this work we advance the understanding of the fundamental limits of computation for Binary Polynomial Optimization (BPO), which is the problem of maximizing a given polynomial function over all binary points. In our main result we…

This work considers clustering nodes of a largely incomplete graph. Under the problem setting, only a small amount of queries about the edges can be made, but the entire graph is not observable. This problem finds applications in…

Classical knot theory deals with {\em diagrams} and {\em invariants}. By means of horizontal {\em trisecants}, we construct a new theory of classical braids with invariants valued in {\em pictures}. These pictures are closely related to…

Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

This is a systematic introduction for physicists to the theory of algebras and groups with braid statistics, as developed over the last three years by the author. There are braided lines, braided planes, braided matrices and braided groups…

We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…

In this paper we propose right-angled Artin groups as a platform for secret sharing schemes based on the efficiency (linear time) of the word problem. Inspired by previous work of Grigoriev-Shpilrain in the context of graphs, we define two…

A braided generalization of the concept of Hopf algebra (quantum group) is presented. The generalization overcomes an inherent geometrical inhomogeneity of quantum groups, in the sense of allowing completely pointless objects. All…

In this paper the computational complexity of the (bi)simulation problem over restricted graph classes is studied. For trees given as pointer structures or terms the (bi)simulation problem is complete for logarithmic space or NC$^1$,…

We study a novel type of braid groups on a closed orientable surface $\Sigma$. These are fundamental groups of certain manifolds that are hybrids between symmetric products and configuration spaces of points on $\Sigma$; a class of examples…

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 give a precise definition of ``generic-case complexity'' and show that for a very large class of finitely generated groups the classical decision problems of group theory - the word, conjugacy and membership problems - all have…

The topology of symplectic 4-manifolds is related to that of singular plane curves via the concept of branched covers. Thus, various classification problems concerning symplectic 4-manifolds can be reformulated as questions about singular…

In this paper we study the reduction curves of a braid, and how they can be used to decompose the braid into simpler ones in a precise way, which does not correspond exactly to the decomposition given by Thurston theory. Then we study how a…