Conjugacy problem for braid groups and Garside groups.

DOI10.1016/S0021-8693(03)00292-8zbMath1043.20019arXivmath/0112310WikidataQ59275321 ScholiaQ59275321MaRDI QIDQ1403868

Juan González-Meneses, Nuno Franco

Publication date: 20 August 2003

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

conjugacy classesbraid groupsArtin groupsconjugacy problemGarside groupssmall Gaussian groups

Mathematics Subject Classification ID

Conjugacy classes for groups (20E45) Braid groups; Artin groups (20F36) Topological methods in group theory (57M07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

On the centralizer of generic braids, Conjugacy languages in groups, The \(n\)th root of a braid is unique up to conjugacy., Tame Garside monoids., A parallel evolutionary approach to solving systems of equations in polycyclic groups, Garside groups are strongly translation discrete., The conjugacy problem and virtually cyclic subgroups in the Artin braid group quotient \(B_n/[P_{n},P_{n}\)], FAST ALGORITHMIC NIELSEN–THURSTON CLASSIFICATION OF FOUR-STRAND BRAIDS, Presentations of Dehn quandles, Abelian Subgroups of Garside Groups, Affine braid groups: a better platform than braid groups for cryptology?, Conjugacy search in braid groups. From a braid-based cryptogrphy point of view, Small braids with large ultra summit set., Twisted conjugacy in braid groups., Reducible braids and Garside theory., THE SUBWORD REVERSING METHOD, A Garside-theoretic approach to the reducibility problem in braid groups., Conjugacy in Garside groups. II: Structure of the ultra summit set., On the structure of the centralizer of a braid, The cyclic sliding operation in Garside groups., Basic results on braid groups., Groups With Two Generators Having Unsolvable Word Problem and Presentations of Mihailova Subgroups of Braid Groups, Solving the conjugacy problem in Garside groups by cyclic sliding., Entity authentication schemes using braid word reduction, A weak key test for braid based cryptography., There exist conjugate simple braids whose associated permutations are not strongly conjugate, Braids, their Properties and Generalizations, Transitive Signatures from Braid Groups, Towards generating secure keys for braid cryptography, Evolution of group-theoretic cryptology attacks using hyper-heuristics, A New Approach to Extracting Roots in Garside Groups, On parabolic subgroups of Artin-Tits groups of spherical type, Left-Garside categories, self-distributivity, and braids, A FAMILY OF PSEUDO-ANOSOV BRAIDS WITH LARGE CONJUGACY INVARIANT SETS, Conjugacy Problem for Subgroups with Applications to Artin Groups and Braid Type Group, A new approach to the conjugacy problem in Garside groups., New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups

Cites Work

• Unnamed Item
• Unnamed Item
• Artin groups of finite type are biautomatic
• A new approach to the word and conjugacy problems in the braid groups
• A note on words in braid monoids
• An algebraic method for public-key cryptography
• Artin-Gruppen und Coxeter-Gruppen
• Theory of braids
• THE CONJUGACY PROBLEM IN SMALL GAUSSIAN GROUPS
• Groupes de Garside
• Transformation Groups and Natural Bundles
• ALGORITHMS FOR POSITIVE BRAIDS
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• THE BRAID GROUP AND OTHER GROUPS
• The infimum, supremum, and geodesic length of a braid conjugacy class.