๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of Dehn's algorithm for word problems in groups

โœ Scribed by B Domanski; M Anshel

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
361 KB
Volume
6
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Dehn's algorithm for the word problem
Dehn's algorithm for the word problem
โœ Martin Greendlinger ๐Ÿ“‚ Article ๐Ÿ“… 1960 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 778 KB
A New Algorithm for Solving the Word Pro
A New Algorithm for Solving the Word Problem in Braid Groups
โœ D. Garber; S. Kaplan; M. Teicher ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 148 KB

One of the most interesting questions about a group is whether its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists, and geometers, and is the target of intensive current research. We look at the braid group from a topologi

On complexity of the word problem in bra
On complexity of the word problem in braid groups and mapping class groups
โœ Hessam Hamidi-Tehrani ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 350 KB

We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w| 2 g) for |w| log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in the case of the closed surface is O(|w| 2 g 2 ). We also carry

An Algorithm for Solving the Factorizati
An Algorithm for Solving the Factorization Problem in Permutation Groups
โœ T. Minkwitz ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 345 KB

The factorization problem in permutation groups is to represent an element g of some permutation group G as a word over a given set S of generators of G. For practical purposes, the word should be as short as possible, but must not be minimal. Like many other problems in computational group theory,