Reconstruction of braids

DOI10.1007/BF00971559MaRDI QIDQ792457zbMATH OpenOpenAlexFDO

Authors V. B. Styshnev

Publication date 1984

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00971559

zbMATH Keywords

braidsfragmentssmooth braid

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Braid groups; Artin groups (20F36)

Review text

A fragment of a braid is obtained by removing one of its strings. It is always possible to recover a braid from the collection of all of its fragments. There exists an algorithm which decides whether a sequence of braids is the collection of all fragments of some braid. Further two braids have the same collection of fragments if and only if they differ by a smooth braid.

Recommendations

• Braids and dynamics
• scientific article; zbMATH DE number 3966413
• ON THE RECOGNITION OF BRAIDS
• Braids
• Braids and Knots
• Boundary braids
• scientific article; zbMATH DE number 1361756
• Braids: a survey
• Composition problems for braids

Cited in

(3)

• Braidoids
• Constructing a braid of partitions from hierarchies of partitions
• scientific article; zbMATH DE number 4123323 (Why is no real title available?)

This page was built for publication: Reconstruction of braids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792457)