Syntactical methods for braids of three strands (Q5938545)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Syntactical methods for braids of three strands |
scientific article; zbMATH DE number 1622579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Syntactical methods for braids of three strands |
scientific article; zbMATH DE number 1622579 |
Statements
Syntactical methods for braids of three strands (English)
0 references
22 July 2001
0 references
The author investigates the three-strand positive braid monoid. He proposes a syntactical linear time algorithm for the word problem, a nearly canonical rewriting system and the computation of the growth function.
0 references
positive braid monoids
0 references
word problem
0 references
rewriting systems
0 references
growth functions
0 references
syntactical linear time algorithms
0 references
0 references
0 references
0.8906862
0 references
0.87835133
0 references
0.8498014
0 references
0 references
0 references
0.83913237
0 references
0.8371775
0 references
0 references
