On the cycling operation in braid groups.

DOI10.1016/j.dam.2008.01.023zbMath1200.20027arXiv0704.2600OpenAlexW1973925932WikidataQ59275307 ScholiaQ59275307MaRDI QIDQ1003696

Volker Gebhardt, Juan González-Meneses

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0704.2600

zbMATH Keywords

braid groupsconjugacy problemcyclingGarside groupsnormal form theoremsconjugacy search problemultra summit setsbraid-based cryptography

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Abelian and solvable subgroups of the mapping class group
• Translation numbers in a Garside group are rational with uniformly bounded denominators.
• Fragments of the word \(\Delta\) in a braid group
• A new approach to the word and conjugacy problems in the braid groups
• An algebraic method for public-key cryptography
• The \(n\)th root of a braid is unique up to conjugacy.
• Conjugacy in Garside groups. III: Periodic braids.
• Conjugacy in Garside groups. I: Cyclings, powers and rigidity.
• Conjugacy in Garside groups. II: Structure of the ultra summit set.
• Les immeubles des groupes de tresses généralises
• A new approach to the conjugacy problem in Garside groups.
• Theory of braids
• Groupes de Garside
• The dual braid monoid
• ALGORITHMS FOR POSITIVE BRAIDS
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• BRAIDS AND THE NIELSEN-THURSTON CLASSIFICATION
• THE BRAID GROUP AND OTHER GROUPS