Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/51317
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGorbunova, Irina A.en
dc.date.accessioned2024-03-21T08:51:06Z-
dc.date.available2024-03-21T08:51:06Z-
dc.date.issued2012-
dc.identifier.citationGorbunova I. A. Repetition threshold for circular words / Irina A. Gorbunova // Electronic Journal of Combinatorics. — 2012. — Vol. 19. — № 4.en
dc.identifier.issn1077-8926-
dc.identifier.other43583id
dc.identifier.otherhttp://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=84870223833m
dc.identifier.othera4998307-5b16-4075-91a4-9c577b7dd545pure_uuid
dc.identifier.urihttp://elar.urfu.ru/handle/10995/51317-
dc.description.abstractWe find the threshold between avoidable and unavoidable repetitions in circular words over k letters for any k ≥ 6. Namely, we show that the number CRT(k), satisfies the following properties. For any n there exists a k-ary circular word of length n containing no repetition of exponent greater than CRT(k). On the other hand, k-ary circular words of some lengths must have a repetition of exponent at least CRT(k).en
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.publisherThe Japan Institute of Heterocyclic Chemistryen
dc.sourceElectronic Journal of Combinatoricsen
dc.subjectCIRCULAR WORDSen
dc.subjectDEJEAN'S CONJECTUREen
dc.subjectREPETITION THRESHOLDen
dc.titleRepetition threshold for circular wordsen
dc.typeArticleen
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.typeinfo:eu-repo/semantics/articleen
dc.identifier.scopus84870223833-
local.affiliationUral Federal University, Ekaterinburg, Russian Federationen
local.contributor.employeeГорбунова Ирина Анатольевнаru
local.issue4-
local.volume19-
dc.identifier.wos000310433600005-
local.contributor.departmentИнститут естественных наук и математикиru
local.identifier.pure1073295-
local.description.order11-
local.identifier.eid2-s2.0-84870223833-
local.identifier.wosWOS:000310433600005-
Appears in Collections:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84870223833.pdf419,72 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.