{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:05Z","timestamp":1753893785768,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We determine the subword complexity of the characteristic functions of a two-parameter family $\\{A_n\\}_{n=1}^\\infty$ of infinite sequences  which are associated with the winning strategies for a family of 2-player games. A special case of the family has the form $A_n=\\lfloor n\\alpha\\rfloor$ for all $n\\in {\\bf Z}_{&gt;0}$, where $\\alpha$ is a fixed positive irrational number. The characteristic functions of such sequences have been shown to have subword complexity $n+1$. We show that every sequence in the extended family has subword complexity $O(n)$.<\/jats:p>","DOI":"10.37236\/1609","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:13:37Z","timestamp":1578708817000},"source":"Crossref","is-referenced-by-count":2,"title":["The Subword Complexity of a Two-Parameter Family of Sequences"],"prefix":"10.37236","volume":"8","author":[{"given":"Aviezri S.","family":"Fraenkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamar","family":"Seeman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamie","family":"Simpson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2001,6,2]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v8i2r10\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v8i2r10\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:17:56Z","timestamp":1579324676000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v8i2r10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6,2]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2001,2,6]]}},"URL":"https:\/\/doi.org\/10.37236\/1609","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2001,6,2]]},"article-number":"R10"}}