The word problem in Hanoi Towers groups

dc.contributor.author	Bondarenko, I.
dc.date.accessioned	2019-06-14T03:23:12Z
dc.date.available	2019-06-14T03:23:12Z
dc.date.issued	2014
dc.identifier.citation	The word problem in Hanoi Towers groups / I. Bondarenko // Algebra and Discrete Mathematics. — 2014. — Vol. 17, № 2. — С. 248–255. — Бібліогр.: 9 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2010 MSC:68R05, 20F10.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/153336
dc.description.abstract	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)).	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	The word problem in Hanoi Towers groups	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA