{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:28:18Z","timestamp":1742952498482,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031095733"},{"type":"electronic","value":"9783031095740"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09574-0_19","type":"book-chapter","created":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T17:36:07Z","timestamp":1656005767000},"page":"302-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Abelian Repetition Threshold Revisited"],"prefix":"10.1007","author":[{"given":"Elena A.","family":"Petrova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arseny M.","family":"Shur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,24]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2007.06.001","volume":"385","author":"A Carpi","year":"1999","unstructured":"Carpi, A.: On Dejean\u2019s conjecture over large alphabets. Theoret. Comput. Sci. 385, 137\u2013151 (1999)","journal-title":"Theoret. Comput. Sci."},{"issue":"8","key":"19_CR2","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1006\/eujc.1999.0329","volume":"20","author":"J Cassaigne","year":"1999","unstructured":"Cassaigne, J., Currie, J.D.: Words strongly avoiding fractional powers. Eur. J. Comb. 20(8), 725\u2013737 (1999)","journal-title":"Eur. J. Comb."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1090\/S0025-5718-2010-02407-X","volume":"80","author":"JD Currie","year":"2011","unstructured":"Currie, J.D., Rampersad, N.: A proof of Dejean\u2019s conjecture. Math. Comp. 80, 1063\u20131070 (2011)","journal-title":"Math. Comp."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2021.03.010","volume":"866","author":"JD Currie","year":"2021","unstructured":"Currie, J.D., Mol, L.: The undirected repetition threshold and undirected pattern avoidance. Theor. Comput. Sci. 866, 56\u201369 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Currie, J.D., Mol, L., Rampersad, N.: Circular repetition thresholds on some small alphabets: last cases of Gorbunova\u2019s conjecture. Electron. J. Comb. 26(2), P2.31 (2019)","DOI":"10.37236\/7985"},{"key":"19_CR6","unstructured":"Currie, J.D., Mol, L., Rampersad, N.: The number of threshold words on $$n$$ letters grows exponentially for every $$n \\ge 27$$. J. Integer Seq. 23(3), 20.3.1 (2020)"},{"key":"19_CR7","unstructured":"Currie, J.D., Mol, L., Rampersad, N.: The repetition threshold for binary rich words. Discret. Math. Theor. Comput. Sci. 22(1) (2020)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0097-3165(72)90011-8","volume":"13","author":"F Dejean","year":"1972","unstructured":"Dejean, F.: Sur un th\u00e9or\u00e8me de Thue. J. Combin. Theory. Ser. A 13, 90\u201399 (1972)","journal-title":"J. Combin. Theory. Ser. A"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0097-3165(79)90044-X","volume":"27","author":"FM Dekking","year":"1979","unstructured":"Dekking, F.M.: Strongly non-repetitive sequences and progression-free sets. J. Combin. Theory. Ser. A 27, 181\u2013185 (1979)","journal-title":"J. Combin. Theory. Ser. A"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-030-85088-3_7","volume-title":"Combinatorics on Words","author":"F Dolce","year":"2021","unstructured":"Dolce, F., Dvo\u0159\u00e1kov\u00e1, L., Pelantov\u00e1, E.: Computation of critical exponent in balanced sequences. In: Lecroq, T., Puzynina, S. (eds.) WORDS 2021. LNCS, vol. 12847, pp. 78\u201390. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85088-3_7"},{"key":"19_CR11","unstructured":"Erd\u0151s, P.: Some unsolved problems. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 6, 221\u2013264 (1961)"},{"key":"19_CR12","first-page":"536","volume":"9","author":"AA Evdokimov","year":"1968","unstructured":"Evdokimov, A.A.: Strongly asymmetric sequences generated by a finite number of symbols. Soviet Math. Dokl. 9, 536\u2013539 (1968)","journal-title":"Soviet Math. Dokl."},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"P11","DOI":"10.37236\/2365","volume":"19","author":"IA Gorbunova","year":"2012","unstructured":"Gorbunova, I.A.: Repetition threshold for circular words. Electron. J. Comb. 19(4), P11 (2012)","journal-title":"Electron. J. Comb."},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-55719-9_62","volume-title":"Automata, Languages and Programming","author":"V Ker\u00e4nen","year":"1992","unstructured":"Ker\u00e4nen, V.: Abelian squares are avoidable on 4 letters. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 41\u201352. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55719-9_62"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(92)90264-G","volume":"95","author":"J Moulin-Ollagnier","year":"1992","unstructured":"Moulin-Ollagnier, J.: Proof of Dejean\u2019s conjecture for alphabets with $$5,6,7,8,9,10$$ and $$11$$ letters. Theoret. Comput. Sci. 95, 187\u2013205 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Pansiot, J.J.: A propos d\u2019une conjecture de F. Dejean sur les r\u00e9p\u00e9titions dans les mots. Discr. Appl. Math. 7, 297\u2013311 (1984)","DOI":"10.1016\/0166-218X(84)90006-4"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-030-81508-0_27","volume-title":"Developments in Language Theory","author":"EA Petrova","year":"2021","unstructured":"Petrova, E.A., Shur, A.M.: Branching frequency and Markov entropy of repetition-free languages. In: Moreira, N., Reis, R. (eds.) DLT 2021. LNCS, vol. 12811, pp. 328\u2013341. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81508-0_27"},{"key":"19_CR18","unstructured":"Radoszewski, J., Rytter, W., Straszynski, J., Walen, T., Zuba, W.: Hardness of detecting abelian and additive square factors in strings. CoRR abs\/2107.09206 (2021)"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.tcs.2018.10.017","volume":"777","author":"N Rampersad","year":"2019","unstructured":"Rampersad, N., Shallit, J.O., Vandomme, \u00c9.: Critical exponents of infinite balanced words. Theoret. Comput. Sci. 777, 454\u2013463 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"3010","DOI":"10.1016\/j.tcs.2010.06.020","volume":"412","author":"M Rao","year":"2011","unstructured":"Rao, M.: Last cases of Dejean\u2019s conjecture. Theoret. Comput. Sci. 412, 3010\u20133018 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1051\/ita\/2011127","volume":"46","author":"AV Samsonov","year":"2012","unstructured":"Samsonov, A.V., Shur, A.M.: On Abelian repetition threshold. RAIRO Theor. Inf. Appl. 46, 147\u2013163 (2012)","journal-title":"RAIRO Theor. Inf. Appl."},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2018.09.010","volume":"792","author":"JO Shallit","year":"2019","unstructured":"Shallit, J.O., Shur, A.M.: Subword complexity and power avoidance. Theoret. Comput. Sci. 792, 96\u2013116 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR23","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 7, 1\u201322 (1906)"},{"key":"19_CR24","unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 1, 1\u201367 (1912)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1007\/978-3-642-32589-2_69","volume-title":"Mathematical Foundations of Computer Science 2012","author":"IN Tunev","year":"2012","unstructured":"Tunev, I.N., Shur, A.M.: On two stronger versions of Dejean\u2019s conjecture. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 800\u2013812. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_69"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09574-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T23:04:13Z","timestamp":1656284653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09574-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031095733","9783031095740"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09574-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}