{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:13Z","timestamp":1753893793150,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Every binary word with at least four letters contains a square. A. Fraenkel and J. Simpson showed that three distinct squares are necessary and sufficient to construct an infinite binary word. We study the following complementary question: how many square occurrences must a binary word contain? We show that this quantity is, in the limit, a constant fraction of the word length, and prove that this constant is $0.55080...$. <\/jats:p>","DOI":"10.37236\/1705","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:29:36Z","timestamp":1578709776000},"source":"Crossref","is-referenced-by-count":7,"title":["How Many Square Occurrences Must a Binary Sequence Contain?"],"prefix":"10.37236","volume":"10","author":[{"given":"Gregory","family":"Kucherov","sequence":"first","affiliation":[]},{"given":"Pascal","family":"Ochem","sequence":"additional","affiliation":[]},{"given":"Micha\u00ebl","family":"Rao","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2003,4,15]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v10i1r12\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v10i1r12\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:09:35Z","timestamp":1579324175000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v10i1r12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4,15]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2003,1,6]]}},"URL":"https:\/\/doi.org\/10.37236\/1705","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2003,4,15]]},"article-number":"R12"}}