Braids: generalizations, presentations and algorithmic properties.

MaRDI QIDQ2371282zbMATH OpenFDO

Authors Vladimir Vershinin

Publication date 2 July 2007

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/53323

zbMATH Keywords

Garside algorithmgeneralizations of braidsknot theory

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) Free semigroups, generators and relations, word problems (20M05) Topological methods in group theory (57M07)

Cited in

(9)

• Combinatorial properties of virtual braids.
• Geometric subgroups of surface braid groups
• A general approach to fast prototype the topology of braided structures
• Braided systems: a unified treatment of algebraic structures with several operations
• Some new results in the theory of braids and generalised braids
• Braid order, sets, and knots.
• Braids, their Properties and Generalizations
• Design and serial construction of digraph braids
• On homological properties of singular braids

This page was built for publication: Braids: generalizations, presentations and algorithmic properties.

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