Composition problems for braids: Membership, Identity and Freeness

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.

[1]  Jeffrey Shallit,et al.  Automata and Reduced Words in the Free Group , 2009, ArXiv.

[2]  Alexei G. Myasnikov,et al.  Random Subgroups of Braid Groups: An Approach to Cryptanalysis of a Braid Group Based Cryptographic Protocol , 2006, Public Key Cryptography.

[3]  Patrick Dehornoy,et al.  Unprovability results involving braids , 2007, 0711.3785.

[4]  Henning Fernau,et al.  Sequential grammars and automata with valences , 2002, Theor. Comput. Sci..

[5]  Karl Mahlburg,et al.  AN OVERVIEW OF BRAID GROUP CRYPTOGRAPHY , 2004 .

[6]  Paul E. Schupp,et al.  Membership Problem for the Modular Group , 2007, SIAM J. Comput..

[7]  F. A. Garside,et al.  THE BRAID GROUP AND OTHER GROUPS , 1969 .

[8]  Jean-Camille Birget,et al.  Two-letter group codes that preserve aperiodicity of inverse finite automata , 2007 .

[9]  Igor Potapov,et al.  On the Computational Complexity of Matrix Semigroup Problems , 2012, Fundam. Informaticae.

[10]  Alexei G. Myasnikov,et al.  A Practical Attack on a Braid Group Based Cryptographic Protocol , 2005, CRYPTO.

[11]  Igor Potapov,et al.  Mortality for 2×2 Matrices Is NP-Hard , 2012, MFCS.

[12]  Julien Cassaigne.  On the Decidability of the Freeness of Matrix Semigroups , 2007 .

[13]  Louis H. Kauffman,et al.  Quantizing braids and other mathematical structures: the general quantization procedure , 2011, Defense + Commercial Sensing.

[14]  Patrick Dehornoy,et al.  Ordering Braids , 2008 .

[15]  Igor Potapov.  Composition Problems for Braids , 2013, FSTTCS.

[16]  Christian Choffrut,et al.  Some decision problems on integer matrices , 2005, RAIRO Theor. Informatics Appl..

[17]  David Garber,et al.  Braid Group Cryptography , 2007, ArXiv.

[18]  Christoph Haase,et al.  Context-Free Commutative Grammars with Integer Counters and Resets , 2018, Theor. Comput. Sci..

[19]  Igor Potapov,et al.  The Identity Problem for Matrix Semigroups in SL2(ℤ) is NP-complete , 2017, SODA.

[20]  Tero Harju,et al.  Weighted Automata on Infinite Words in the Context of Attacker-Defender Games , 2015, CiE.

[21]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[22]  Andrey Bovykin,et al.  Long games on braids , 2006 .

[23]  Igor Potapov,et al.  On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups , 2010, Int. J. Found. Comput. Sci..

[24]  V. N. Bezverkhnii,et al.  On the unsolvability of the conjugacy problem for subgroups of the groupR5 of pure braids , 1999 .

[25]  A. M. Akimenkov.  Subgroups of the braid group B4 , 1991 .

[26]  Hendrik Jan Hoogeboom.  Context-Free Valence Grammars - Revisited , 2001, Developments in Language Theory.

[27]  Stepan Yu Orevkov,et al.  Quasipositivity Problem for 3-Braids , 2003 .

[28]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[29]  Alexander A. Razborov,et al.  The Set of Minimal Braids is co-NP-Complete , 1991, J. Algorithms.