- We will send in 10–14 business days.
/images/books/13176171/9783639138986.jpg)
- Author: Elie Feder
- Publisher: VDM Verlag
- ISBN-10: 3639138988
- ISBN-13: 9783639138986
- Format: 15.2 x 22.9 x 0.5 cm, softcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
The study of braid groups and their applications is a field which has attracted the interest of mathematicians and computer scientists alike. We begin with a review of the notion of a braid group. We then discuss known solutions to decision problems in braid groups. We then prove new results in braid group algorithmics. We offer a quick solution to the generalized word problem in braid groups, in the special case of cyclic subgroups. We illustrate this solution using a multitape Turing machine. We then turn to a discussion of decision problems in cyclic amalgamations of groups and solve the word problem for the cyclic amalgamation of two braid groups. We then turn to a more general study of the conjugacy problem in cyclic amalgamations. We revise and prove some theorems of Lipschutz and show their application to cyclic amalgamations of braid groups. We generalize this application to prove a new theorem regarding the conjugacy problem in cyclic amalgamations. We then discuss some application of braid groups, culminating in a section devoted to the discussion of braid group cryptography.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 16d.14:54:26
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Elie Feder
- Publisher: VDM Verlag
- ISBN-10: 3639138988
- ISBN-13: 9783639138986
- Format: 15.2 x 22.9 x 0.5 cm, softcover
- Language: English English
The study of braid groups and their applications is a field which has attracted the interest of mathematicians and computer scientists alike. We begin with a review of the notion of a braid group. We then discuss known solutions to decision problems in braid groups. We then prove new results in braid group algorithmics. We offer a quick solution to the generalized word problem in braid groups, in the special case of cyclic subgroups. We illustrate this solution using a multitape Turing machine. We then turn to a discussion of decision problems in cyclic amalgamations of groups and solve the word problem for the cyclic amalgamation of two braid groups. We then turn to a more general study of the conjugacy problem in cyclic amalgamations. We revise and prove some theorems of Lipschutz and show their application to cyclic amalgamations of braid groups. We generalize this application to prove a new theorem regarding the conjugacy problem in cyclic amalgamations. We then discuss some application of braid groups, culminating in a section devoted to the discussion of braid group cryptography.
Reviews