The word problem in Hanoi Towers groups
Vernadsky National Library of Ukraine
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
The word problem in Hanoi Towers groups
|
|
| Creator |
Bondarenko, I.
|
|
| Description |
We prove that the elements of the Hanoi Towers groups Hm have depth bounded from above by a poly-logarithmic function O(logm⁻²n), where n is the length of an element. Therefore the word problem in groups Hm is solvable in subexponential time exp(O(logm⁻²n)).
|
|
| Date |
2019-06-14T03:23:12Z
2019-06-14T03:23:12Z 2014 |
|
| Type |
Article
|
|
| Identifier |
The word problem in Hanoi Towers groups / I. Bondarenko // Algebra and Discrete Mathematics. — 2014. — Vol. 17, № 2. — С. 248–255. — Бібліогр.: 9 назв. — англ.
1726-3255 2010 MSC:68R05, 20F10. http://dspace.nbuv.gov.ua/handle/123456789/153336 |
|
| Language |
en
|
|
| Relation |
Algebra and Discrete Mathematics
|
|
| Publisher |
Інститут прикладної математики і механіки НАН України
|
|