The word problem in Hanoi Towers groups
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)).
Gespeichert in:
| Veröffentlicht in: | Algebra and Discrete Mathematics |
|---|---|
| Datum: | 2014 |
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Інститут прикладної математики і механіки НАН України
2014
|
| Online Zugang: | https://nasplib.isofts.kiev.ua/handle/123456789/153336 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Zitieren: | The word problem in Hanoi Towers groups / I. Bondarenko // Algebra and Discrete Mathematics. — 2014. — Vol. 17, № 2. — С. 248–255. — Бібліогр.: 9 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| id |
nasplib_isofts_kiev_ua-123456789-153336 |
|---|---|
| record_format |
dspace |
| spelling |
Bondarenko, I. 2019-06-14T03:23:12Z 2019-06-14T03:23:12Z 2014 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. https://nasplib.isofts.kiev.ua/handle/123456789/153336 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)). en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics The word problem in Hanoi Towers groups Article published earlier |
| institution |
Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| collection |
DSpace DC |
| title |
The word problem in Hanoi Towers groups |
| spellingShingle |
The word problem in Hanoi Towers groups Bondarenko, I. |
| title_short |
The word problem in Hanoi Towers groups |
| title_full |
The word problem in Hanoi Towers groups |
| title_fullStr |
The word problem in Hanoi Towers groups |
| title_full_unstemmed |
The word problem in Hanoi Towers groups |
| title_sort |
word problem in hanoi towers groups |
| author |
Bondarenko, I. |
| author_facet |
Bondarenko, I. |
| publishDate |
2014 |
| language |
English |
| container_title |
Algebra and Discrete Mathematics |
| publisher |
Інститут прикладної математики і механіки НАН України |
| format |
Article |
| 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)).
|
| issn |
1726-3255 |
| url |
https://nasplib.isofts.kiev.ua/handle/123456789/153336 |
| citation_txt |
The word problem in Hanoi Towers groups / I. Bondarenko // Algebra and Discrete Mathematics. — 2014. — Vol. 17, № 2. — С. 248–255. — Бібліогр.: 9 назв. — англ. |
| work_keys_str_mv |
AT bondarenkoi thewordprobleminhanoitowersgroups AT bondarenkoi wordprobleminhanoitowersgroups |
| first_indexed |
2025-12-07T18:38:22Z |
| last_indexed |
2025-12-07T18:38:22Z |
| _version_ |
1850875788228820992 |