{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T02:09:33Z","timestamp":1780106973582,"version":"3.54.0"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ejc.2026.104393","type":"journal-article","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T20:02:47Z","timestamp":1778356967000},"page":"104393","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Combinatorics on finite words and the length of a finite-dimensional associative algebra"],"prefix":"10.1016","volume":"136","author":[{"given":"M.A.","family":"Khrystik","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ejc.2026.104393_b1","first-page":"123","article-title":"Properties of the complexity function for finite words","volume":"33","author":"Anisiu","year":"2004","journal-title":"Rev. D\u2019Analyse Num\u00e9rique et de Th\u00e9orie de L\u2019Approximation"},{"issue":"9","key":"10.1016\/j.ejc.2026.104393_b2","doi-asserted-by":"crossref","first-page":"6487","DOI":"10.1090\/S0002-9947-2015-06391-0","article-title":"Nonexpansive Z2-subdynamics and Nivat\u2019s conjecture","volume":"367","author":"Cyr","year":"2015","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/j.ejc.2026.104393_b3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0304-3975(98)00248-5","article-title":"On the combinatorics of finite words","volume":"218","author":"de Luca","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.ejc.2026.104393_b4","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/s10958-024-07105-0","article-title":"Length of the group algebra of the direct product of a cyclic group and a cyclic p-group in the modular case","volume":"281","author":"Khrystik","year":"2024","journal-title":"J. Math. Sci."},{"issue":"2","key":"10.1016\/j.ejc.2026.104393_b5","first-page":"1132","article-title":"Length of the group algebra of the direct product of a cyclic group and an elementary abelian p-group in the modular case","volume":"21","author":"Khrystik","year":"2024","journal-title":"Sib. Electron. Math. Rep."},{"issue":"1","key":"10.1016\/j.ejc.2026.104393_b6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1017\/S0004972724001400","article-title":"An upper bound on the length of an algebra and its application to the group algebra of the dihedral group","volume":"112","author":"Khrystik","year":"2025","journal-title":"Bull. Aust. Math. Soc."},{"key":"10.1016\/j.ejc.2026.104393_b7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.laa.2024.10.019","article-title":"A proof of the Paz conjecture for 6\u00a0\u00d7\u00a06 matrices","volume":"704","author":"Khrystik","year":"2025","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"10.1016\/j.ejc.2026.104393_b8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.36045\/bbms\/1102714173","article-title":"Proof of a conjecture on word complexity","volume":"8","author":"Lev\u00e9","year":"2001","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"key":"10.1016\/j.ejc.2026.104393_b9","series-title":"Algebraic Combinatorics on Words","author":"Lothaire","year":"2002"},{"issue":"12","key":"10.1016\/j.ejc.2026.104393_b10","doi-asserted-by":"crossref","first-page":"1767","DOI":"10.1070\/SM2009v200n12ABEH004058","article-title":"Upper bound for the length of commutative algebras","volume":"200","author":"Markova","year":"2009","journal-title":"Sb. Math."},{"issue":"4","key":"10.1016\/j.ejc.2026.104393_b11","doi-asserted-by":"crossref","first-page":"815","DOI":"10.2307\/2371264","article-title":"Symbolic dynamics","volume":"60","author":"Morse","year":"1938","journal-title":"Amer. J. Math."},{"key":"10.1016\/j.ejc.2026.104393_b12","series-title":"Invited talk at ICALP, Bologna","author":"Nivat","year":"1997"},{"key":"10.1016\/j.ejc.2026.104393_b13","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1006\/jabr.1997.7140","article-title":"An upper bound for the length of a finite-dimensional algebra","volume":"197","author":"Pappacena","year":"1997","journal-title":"J. Algebra"},{"key":"10.1016\/j.ejc.2026.104393_b14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1080\/03081088408817585","article-title":"An application of the Cayley\u2013Hamilton theorem to matrix polynomials in several variables","volume":"15","author":"Paz","year":"1984","journal-title":"Linear Multilinear Algebra"},{"key":"10.1016\/j.ejc.2026.104393_b15","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.tcs.2018.09.010","article-title":"Subword complexity and power avoidance","volume":"792","author":"Shallit","year":"2019","journal-title":"Theoret. Comput. Sci."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000612?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000612?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T01:47:31Z","timestamp":1780105651000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669826000612"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":15,"alternative-id":["S0195669826000612"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104393","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Combinatorics on finite words and the length of a finite-dimensional associative algebra","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104393","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104393"}}