A fast method for comparing braids

DOI10.1006/aima.1997.1605zbMath0882.20021OpenAlexW2091159398MaRDI QIDQ675872

Patrick Dehornoy

Publication date: 6 May 1997

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7545d55c9fc2dfe55320009db7585f494cf82e30

zbMATH Keywords

automatic structures of braid groupsbraid wordslinear orderings on braidssynthetical algorithms

Mathematics Subject Classification ID

Geometric group theory (20F65) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (38)

REPRESENTING BRAIDS BY AUTOMORPHISMS ⋮ A class of hash functions based on the Algebraic Eraser\(^{\text{TM}}\) ⋮ A FAMILY OF BRUNNIAN LINKS BASED ON EDWARDS' CONSTRUCTION OF VENN DIAGRAMS ⋮ A conjecture about Artin-Tits groups. ⋮ Representations of small braid groups in Temperley-Lieb algebra ⋮ Weak faithfulness properties for the Burau representation ⋮ Some computational aspects in the work of Patrick Dehornoy ⋮ Behind maths: Federating research(ers) ⋮ Generic-case complexity, decision problems in group theory, and random walks. ⋮ A simple algorithm for finding short sigma-definite representatives. ⋮ Affine braid groups: a better platform than braid groups for cryptology? ⋮ Complete positive group presentations. ⋮ Every braid admits a short sigma-definite expression. ⋮ Braid lift representations of Artin's Braid Group ⋮ A new distinguished form for 3-braids ⋮ THE SUBWORD REVERSING METHOD ⋮ A simple algorithm to compute link polynomials defined by using skein relations ⋮ \(C^1\) actions on the mapping class groups on the circle ⋮ Mapping class groups of covers with boundary and braid group embeddings ⋮ A new proof of the faithfulness of the Temperley–Lieb representation of B3 ⋮ A product on double cosets of \(B_\infty\) ⋮ Entity authentication schemes using braid word reduction ⋮ A weak key test for braid based cryptography. ⋮ Description chirurgicale des revêtements triples simples de \(S^3\) ramifiés le long d'un entrelacs. (Surgery description of simple three fold coverings of the 3-sphere branched along a link) ⋮ A Practical Attack on a Certain Braid Group Based Shifted Conjugacy Authentication Protocol ⋮ Mean-set attack: cryptanalysis of Sibert et al. authentication protocol ⋮ Attack on Kayawood protocol: uncloaking private keys ⋮ The braid shelf ⋮ Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux Key Agreement Protocol ⋮ Efficient solutions to the braid isotopy problem. ⋮ A new approach to the word and conjugacy problems in the braid groups ⋮ Noncommutative independence from the braid group \({\mathbb{B}_{\infty}}\) ⋮ Some aspects of the SD-world ⋮ An attack on the Walnut digital signature algorithm ⋮ ON WORD REVERSING IN BRAID GROUPS ⋮ The fine structure of LD-equivalence ⋮ A new algorithm for solving the word problem in braid groups ⋮ Identifying half-twists using randomized algorithm methods.

Cites Work

• Unnamed Item
• Unnamed Item
• Groups with a complemented presentation
• On braid words and irreflexivity
• The wellordering on positive braids
• Braid group actions on left distributive structures, and well orderings in the braid groups
• Les immeubles des groupes de tresses généralises
• Theory of braids
• An Isoperimetric Inequality for Artin Groups of Finite Type
• The set of minimal braids is co-NP-complete
• Braids, Links, and Mapping Class Groups. (AM-82)
• Left-distributive idempotent algebras
• Braid Groups and Left Distributive Operations
• ALGORITHMS FOR POSITIVE BRAIDS
• FROM LARGE CARDINALS TO BRAIDS VIA DISTRIBUTIVE ALGEBRA
• THE BRAID GROUP AND OTHER GROUPS

This page was built for publication: A fast method for comparing braids