English

Complete simultaneous conjugacy invariants in Artin's braid groups

Group Theory 2018-02-16 v5 Computational Complexity Cryptography and Security

Abstract

We solve the simultaneous conjugacy problem in Artin's braid groups and, more generally, in Garside groups, by means of a complete, effectively computable, finite invariant. This invariant generalizes the one-dimensional notion of super summit set to arbitrary dimensions. One key ingredient in our solution is the introduction of a provable high-dimensional version of the Birman--Ko--Lee cycling theorem. The complexity of this solution is a small degree polynomial in the cardinalities of our generalized super summit sets and the input parameters. Computer experiments suggest that the cardinality of this invariant, for a list of order NN independent elements of Artin's braid group BNB_N, is generically close to~1.

Keywords

Cite

@article{arxiv.1403.4622,
  title  = {Complete simultaneous conjugacy invariants in Artin's braid groups},
  author = {Arkadius Kalka and Boaz Tsaban and Gary Vinokur},
  journal= {arXiv preprint arXiv:1403.4622},
  year   = {2018}
}

Comments

Improved some aspects, added a discussion of Garside families. Paper ready for submission

R2 v1 2026-06-22T03:29:29.011Z