𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some problems on the universality of words in groups

✍ Scribed by A. Ehrenfeucht; S. Fajtlowicz; J. Malitz; J. Mycielski

Book ID
112760104
Publisher
Springer
Year
1980
Tongue
English
Weight
118 KB
Volume
11
Category
Article
ISSN
0002-5240

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On some sequencing problems in finite gr
On some sequencing problems in finite groups
✍ Michael D. Miller; Richard J. Friedlander πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 876 KB

A finite group is called Z-sequenceable if its non-identity eiements can be listed x,. x2,. . ., x, $0 that XIX,+~ =&+I& fC?r i 'l,Z,...,rZ-1. Various necessary and sufficient conditions are determined for such sequencings to exist. In particular, it is proved that if n B 3, then the symmetric grbup

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