{"id":"https://openalex.org/W4405812762","doi":"https://doi.org/10.37236/12464","title":"The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold","display_name":"The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold","publication_year":2024,"publication_date":"2024-12-26","ids":{"openalex":"https://openalex.org/W4405812762","doi":"https://doi.org/10.37236/12464"},"language":"en","primary_location":{"id":"doi:10.37236/12464","is_oa":true,"landing_page_url":"https://doi.org/10.37236/12464","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v31i4p77/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v31i4p77/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065770361","display_name":"James D. Currie","orcid":"https://orcid.org/0000-0002-0061-3849"},"institutions":[{"id":"https://openalex.org/I872945872","display_name":"University of Winnipeg","ror":"https://ror.org/02gdzyx04","country_code":"CA","type":"education","lineage":["https://openalex.org/I872945872"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"James D. Currie","raw_affiliation_strings":["Department of Mathematics and Statistics , University of Winnipeg , 515 Portage Avenue , Winnipeg , Manitoba , Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics , University of Winnipeg , 515 Portage Avenue , Winnipeg , Manitoba , Canada","institution_ids":["https://openalex.org/I872945872"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023519726","display_name":"Narad Rampersad","orcid":"https://orcid.org/0000-0001-7489-0980"},"institutions":[{"id":"https://openalex.org/I872945872","display_name":"University of Winnipeg","ror":"https://ror.org/02gdzyx04","country_code":"CA","type":"education","lineage":["https://openalex.org/I872945872"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Narad Rampersad","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Winnipeg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Winnipeg","institution_ids":["https://openalex.org/I872945872"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I872945872"],"apc_list":null,"apc_paid":null,"fwci":0.5557,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73835633,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"31","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9830999970436096,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9830999970436096,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.8374229669570923},{"id":"https://openalex.org/keywords/repetition","display_name":"Repetition (rhetorical device)","score":0.79908287525177},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.7032982110977173},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.663610577583313},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.5356210470199585},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.466524213552475},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4054705798625946},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33158186078071594},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.2021068036556244},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.06263801455497742}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.8374229669570923},{"id":"https://openalex.org/C2776141515","wikidata":"https://www.wikidata.org/wiki/Q1274479","display_name":"Repetition (rhetorical device)","level":2,"score":0.79908287525177},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.7032982110977173},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.663610577583313},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.5356210470199585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.466524213552475},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4054705798625946},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33158186078071594},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.2021068036556244},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.06263801455497742},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/12464","is_oa":true,"landing_page_url":"https://doi.org/10.37236/12464","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v31i4p77/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/12464","is_oa":true,"landing_page_url":"https://doi.org/10.37236/12464","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v31i4p77/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5472325981","display_name":null,"funder_award_id":"2019-04111","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4405812762.pdf","grobid_xml":"https://content.openalex.org/works/W4405812762.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W6704825369"],"related_works":["https://openalex.org/W1993634787","https://openalex.org/W3125614403","https://openalex.org/W4400317913","https://openalex.org/W2476923378","https://openalex.org/W3100240142","https://openalex.org/W2803221307","https://openalex.org/W4211001408","https://openalex.org/W2903963821","https://openalex.org/W2366147410","https://openalex.org/W4396915211"],"abstract_inverted_index":{"A":[0],"word":[1,34,63],"is":[2,27,53],"rich":[3,51,62],"if":[4],"each":[5],"of":[6,24,35],"its":[7],"length":[8],"$n$":[9,12],"factors":[10],"contains":[11,38],"distinct":[13],"non-empty":[14],"palindromes.":[15],"For":[16],"a":[17,39],"language":[18],"${\\mathcal":[19,25,36],"L}$,":[20],"the":[21,46,57],"repetition":[22,47],"threshold":[23,48],"L}$":[26,37],"defined":[28],"by$$\\text{RT}({\\mathcal":[29],"L})=\\sup\\{k:":[30],"\\text{":[31],"every":[32],"infinite":[33,60],"$k$-power}\\}.$$Currie":[40],"et":[41],"al.":[42],"(2020)":[43],"proved":[44],"that":[45],"for":[49],"binary":[50,61],"words":[52],"$2+\\sqrt{2}/2$.":[54],"We":[55],"exhibit":[56],"lexicographically":[58],"least":[59],"attaining":[64],"this":[65],"threshold.":[66]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}