{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:56:58Z","timestamp":1776859018373,"version":"3.51.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A word is rich if each of its length $n$ factors contains $n$ distinct non-empty palindromes. For a language ${\\mathcal L}$, the repetition threshold of ${\\mathcal L}$ is defined by$$\\text{RT}({\\mathcal L})=\\sup\\{k: \\text{ every infinite word of ${\\mathcal L}$ contains a $k$-power}\\}.$$Currie et al. (2020) proved that the repetition threshold for binary rich words is $2+\\sqrt{2}\/2$. We exhibit the lexicographically least infinite binary rich word attaining this threshold.<\/jats:p>","DOI":"10.37236\/12464","type":"journal-article","created":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T17:23:40Z","timestamp":1735233820000},"source":"Crossref","is-referenced-by-count":1,"title":["The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold"],"prefix":"10.37236","volume":"31","author":[{"given":"James D.","family":"Currie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narad","family":"Rampersad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2024,12,27]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i4p77\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i4p77\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T17:23:40Z","timestamp":1735233820000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v31i4p77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,10,3]]}},"URL":"https:\/\/doi.org\/10.37236\/12464","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,27]]},"article-number":"P4.77"}}