{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:02:35Z","timestamp":1743098555354,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319236599"},{"type":"electronic","value":"9783319236605"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23660-5_11","type":"book-chapter","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T12:05:10Z","timestamp":1440590710000},"page":"122-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Words with the Maximum Number of Abelian Squares"],"prefix":"10.1007","author":[{"given":"Gabriele","family":"Fici","sequence":"first","affiliation":[]},{"given":"Filippo","family":"Mignosi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,27]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"AS Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, J.: How many squares can a string contain? J. Comb. Theory, Ser. A 82(1), 112\u2013120 (1998)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2007.03.025","volume":"380","author":"L Ilie","year":"2007","unstructured":"Ilie, L.: A note on the number of squares in a word. Theoret. Comput. Sci. 380(3), 373\u2013376 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR3","first-page":"221","volume":"6","author":"P Erd\u00f6s","year":"1961","unstructured":"Erd\u00f6s, P.: Some unsolved problems. Magyar Tud. Akad. Mat. Kutato. Int. Kozl. 6, 221\u2013254 (1961)","journal-title":"Magyar Tud. Akad. Mat. Kutato. Int. Kozl."},{"key":"11_CR4","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)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-319-09698-8_19","volume-title":"Developments in Language Theory","author":"T Kociumaka","year":"2014","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Maximum number of distinct and nonequivalent nonstandard squares in a word. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 215\u2013226. Springer, Heidelberg (2014)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2013.10.007","volume":"525","author":"M Christodoulakis","year":"2014","unstructured":"Christodoulakis, M., Christou, M., Crochemore, M., Iliopoulos, C.S.: On the average number of regularities in a word. Theoret. Comput. Sci. 525, 3\u20139 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"11_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0012-365X(00)00054-6","volume":"222","author":"D Damanik","year":"2000","unstructured":"Damanik, D., Zare, D.: Palindrome complexity bounds for primitive substitution sequences. Discrete Math. 222(1\u20133), 259\u2013267 (2000)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"11_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(92)90274-E","volume":"24","author":"S Brlek","year":"1989","unstructured":"Brlek, S.: Enumeration of factors in the Thue-Morse word. Discr. Appl. Math. 24(1\u20133), 83\u201396 (1989)","journal-title":"Discr. Appl. Math."},{"key":"11_CR9","unstructured":"Cassaigne, J., Fici, G., Sciortino, M., Zamboni, L.: Cyclic Complexity of Words, Submitted (2015). http:\/\/arxiv.org\/abs\/1402.5843"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(89)90013-3","volume":"63","author":"A de Luca","year":"1989","unstructured":"de Luca, A., Varricchio, S.: Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups. Theoret. Comput. Sci. 63(3), 333\u2013348 (1989)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-38771-5_21","volume-title":"Developments in Language Theory","author":"G Fici","year":"2013","unstructured":"Fici, G., Langiu, A., Lecroq, T., Lefebvre, A., Mignosi, F., Prieur-Gaston, \u00c9.: Abelian repetitions in Sturmian words. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 227\u2013238. Springer, Heidelberg (2013)"},{"key":"11_CR13","unstructured":"Rigo, M., Salimov, P., Vandomme, E.: Some properties of abelian return words. J. Integer Seq. 16, 13.2.5 (2013)"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(89)90046-7","volume":"65","author":"F Mignosi","year":"1989","unstructured":"Mignosi, F.: Infinite words with linear subword complexity. Theoret. Comput. Sci. 65(2), 221\u2013242 (1989)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1051\/ita\/1992260301991","volume":"26","author":"F Mignosi","year":"1992","unstructured":"Mignosi, F., Pirillo, G.: Repetitions in the Fibonacci infinite word. RAIRO Theor. Inform. Appl. 26, 199\u2013204 (1992)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"11_CR16","volume-title":"Uniform Distribution of Sequences","author":"L Kuipers","year":"1974","unstructured":"Kuipers, L., Niederreiter, H.: Uniform Distribution of Sequences. Wiley, New York (1974)"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(98)00247-3","volume":"218","author":"J Cassaigne","year":"1999","unstructured":"Cassaigne, J.: Limit values of the recurrence quotient of sturmian sequences. Theoret. Comput. Sci. 218(1), 3\u201312 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Durand, F.: Corrigendum and addendum to: \u201cLinearly recurrent subshifts have a finite number of non-periodic subshift factors\u201d [Ergodic Theory Dynam. Systems 20(4), 1061\u20131078 (2000)]. Ergodic Theory Dynam. Systems 23(2), pp. 663\u2013669 (2003)","DOI":"10.1017\/S0143385702001293"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-63220-4_51","volume-title":"Combinatorial Pattern Matching","author":"AS Fraenkel","year":"1997","unstructured":"Fraenkel, A.S., Simpson, J., Paterson, M.: On weak circular squares in binary words. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol. 1264, pp. 76\u201382. Springer, Heidelberg (1997)"},{"key":"11_CR20","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Walen, T.: Personal communication (2015)"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23660-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T08:18:46Z","timestamp":1676967526000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23660-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319236599","9783319236605"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23660-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}