{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:02Z","timestamp":1740109382705,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"EU\u2019s Horizon 2020 Research and Innovation Programme","award":["ERC 683064"],"award-info":[{"award-number":["ERC 683064"]}]},{"name":"Center for Absorption in Science of the Ministry of Aliyah and Immigration of the State of Israel","award":["Grant number"],"award-info":[{"award-number":["Grant number"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00224-024-10187-7","type":"journal-article","created":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T08:02:55Z","timestamp":1722499375000},"page":"1487-1511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-Constructive Upper Bounds for Repetition Thresholds"],"prefix":"10.1007","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7812-3399","authenticated-orcid":false,"given":"Arseny M.","family":"Shur","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,1]]},"reference":[{"key":"10187_CR1","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske Vid. Selsk. Skr. Mat. Nat. Kl. 7, 1\u201322 (1906)"},{"key":"10187_CR2","unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 1, 1\u201367 (1912)"},{"key":"10187_CR3","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nen, V.: Abelian squares are avoidable on 4 letters. In: Kuich, W. (ed.) Proc. ICALP 1992. LNCS, vol. 623, pp. 41\u201352. Springer (1992)","DOI":"10.1007\/3-540-55719-9_62"},{"key":"10187_CR4","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":"10187_CR5","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":"10187_CR6","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."},{"issue":"2","key":"10187_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1667053.1667060","volume":"57","author":"RA Moser","year":"2010","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general Lov\u00e1sz local lemma. J. ACM 57(2), 11\u201311115 (2010)","journal-title":"J. ACM"},{"issue":"2","key":"10187_CR8","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1002\/rsa.20411","volume":"42","author":"J Grytczuk","year":"2013","unstructured":"Grytczuk, J., Kozik, J., Micek, P.: New approach to nonrepetitive sequences. Random Struct. Algorithms. 42(2), 214\u2013225 (2013)","journal-title":"Random Struct. Algorithms."},{"issue":"337","key":"10187_CR9","doi-asserted-by":"publisher","first-page":"2489","DOI":"10.1090\/mcom\/3732","volume":"91","author":"M Rosenfeld","year":"2022","unstructured":"Rosenfeld, M.: Avoiding squares over words with lists of size three amongst four symbols. Math. Comput. 91(337), 2489\u20132500 (2022)","journal-title":"Math. Comput."},{"issue":"2","key":"10187_CR10","first-page":"2","volume":"21","author":"P Ochem","year":"2014","unstructured":"Ochem, P., Pinlou, A.: Application of entropy compression in pattern avoidance. Electron. J. Comb. 21(2), 2 (2014)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"10187_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1051\/ita\/2016007","volume":"50","author":"G Gu\u00e9gan","year":"2016","unstructured":"Gu\u00e9gan, G., Ochem, P.: A short proof that shuffle squares are 7-avoidable. RAIRO Theor. Informatics Appl. 50(1), 101\u2013103 (2016)","journal-title":"RAIRO Theor. Informatics Appl."},{"key":"10187_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2022.10.028","volume":"941","author":"L Bulteau","year":"2023","unstructured":"Bulteau, L., Jug\u00e9, V., Vialette, S.: On shuffled-square-free words. Theor. Comput. Sci. 941, 91\u2013103 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"10187_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0166-218X(84)90006-4","volume":"7","author":"J-J Pansiot","year":"1984","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)","journal-title":"Discr. Appl. Math."},{"key":"10187_CR14","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":"10187_CR15","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."},{"key":"10187_CR16","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":"10187_CR17","doi-asserted-by":"crossref","unstructured":"Shur, A.M.: Approaching repetition thresholds via local resampling and entropy compression. In: Drewes, F., Volkov, M. (eds.) Developments in Language Theory - 27th International Conference, DLT 2023, Proceedings. Lecture Notes in Computer Science, vol. 13911, pp. 219\u2013232. Springer (2023)","DOI":"10.1007\/978-3-031-33264-7_18"},{"key":"10187_CR18","unstructured":"Cvetkovi\u0107, D.M., Doob, M., Sachs, H.: Spectra of Graphs. Theory and Applications, 3rd edn. Johann Ambrosius Barth, Heidelberg (1995)"},{"key":"10187_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2015.07.027","volume":"601","author":"AM Shur","year":"2015","unstructured":"Shur, A.M.: Generating square-free words efficiently. Theor. Comput. Sci. 601, 67\u201372 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"10187_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1051\/ita\/2010012","volume":"44","author":"AM Shur","year":"2010","unstructured":"Shur, A.M., Gorbunova, I.A.: On the growth rates of complexity of threshold languages. RAIRO Theor. Informatics Appl. 44, 175\u2013192 (2010)","journal-title":"RAIRO Theor. Informatics Appl."},{"issue":"8","key":"10187_CR21","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1142\/S0129054112400631","volume":"23","author":"IA Gorbunova","year":"2012","unstructured":"Gorbunova, I.A., Shur, A.M.: On Pansiot words avoiding 3-repetitions. Int. J. Found. Comput. Sci. 23(8), 1583\u20131594 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10187_CR22","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":"10187_CR23","doi-asserted-by":"crossref","unstructured":"Petrova, E.A., Shur, A.M.: Abelian repetition threshold revisited. In: Kulikov, A.S., Raskhodnikova, S. (eds.) Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Proceedings. Lecture Notes in Computer Science, vol. 13296, pp. 302\u2013319. Springer (2022)","DOI":"10.1007\/978-3-031-09574-0_19"},{"issue":"8","key":"10187_CR24","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."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10187-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-024-10187-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10187-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T06:02:22Z","timestamp":1734156142000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-024-10187-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,1]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10187"],"URL":"https:\/\/doi.org\/10.1007\/s00224-024-10187-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2024,8,1]]},"assertion":[{"value":"6 July 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}