Composition problems for braids: Membership, Identity and Freeness

07/26/2017
by   Sang-Ki Ko, et al.
0

In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with three strands, B_3, have polynomial time solutions we prove that a very natural question for braid composition, the membership problem, is NP-complete for braids with only three strands. The membership problem is decidable in NP for B_3, but it becomes harder for a class of braids with more strands. In particular we show that fundamental problems about braid compositions are undecidable for braids with at least five strands, but decidability of these problems for B_4 remains open. Finally we show that the freeness problem for semigroups of braids from B_3 is also decidable in NP. The paper introduces a few challenging algorithmic problems about topological braids opening new connections between braid groups, combinatorics on words, complexity theory and provides solutions for some of these problems by application of several techniques from automata theory, matrix semigroups and algorithms.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/23/2019

Complexity Results on Register Pushdown Automata

Register pushdown automata (RPDA) is an extension of classical pushdown ...
07/30/2018

An Atemporal Model of Physical Complexity

We present the finite first-order theory (FFOT) machine, which provides ...
05/14/2019

A new algebraic approach to the graph isomorphism and clique problems

As it follows from Gödel's incompleteness theorems, any consistent forma...
11/08/2021

Differential information theory

This paper presents a new foundational approach to information theory ba...
04/05/2019

The Complexity of the Ideal Membership Problem and Theta Bodies for Constrained Problems Over the Boolean Domain

Given an ideal I and a polynomial f the Ideal Membership Problem is to t...
12/19/2019

On the hardness of finding normal surfaces

There are fundamental topological problems, such as unknot recognition a...
02/02/2018

On The Complexity of the Cayley Semigroup Membership Problem

We investigate the complexity of deciding, given a multiplication table ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.