A word of low complexity without uniform frequencies

In this paper, we construct a uniformly recurrent infinite word of low complexity without uniform frequencies of letters. This shows the optimality of a bound of Boshernitzan, which gives a sufficient condition for a uniformly recurrent infinite word to admit uniform frequencies.

Saved in:
Bibliographic Details
Published in:Ergodic theory and dynamical systems 2024-04, Vol.44 (4), p.1013-1025
Main Authors: CASSAIGNE, JULIEN, KABORÉ, IDRISSA
Format: Article
Language:English
Subjects:
Codes
Complexity
Mathematics
Original Article
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c293t-3f7a924e9999daacc9246374e86df855042dee3a8920dd917a135ddc4e6954c53
container_end_page 1025
container_issue 4
container_start_page 1013
container_title Ergodic theory and dynamical systems
container_volume 44
creator CASSAIGNE, JULIEN
KABORÉ, IDRISSA
description In this paper, we construct a uniformly recurrent infinite word of low complexity without uniform frequencies of letters. This shows the optimality of a bound of Boshernitzan, which gives a sufficient condition for a uniformly recurrent infinite word to admit uniform frequencies.
doi_str_mv 10.1017/etds.2023.37
format article
fullrecord <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_04797048v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cupid>10_1017_etds_2023_37</cupid><sourcerecordid>2937214450</sourcerecordid><originalsourceid>FETCH-LOGICAL-c293t-3f7a924e9999daacc9246374e86df855042dee3a8920dd917a135ddc4e6954c53</originalsourceid><addsrcrecordid>eNptkEtLAzEUhYMoWKs7f0DAleCMeU4my1LUCgU3ug4xDztlpqnJjLX_3gwtuvFuLvfw3cPhAHCNUYkRFveut6kkiNCSihMwwaySBWNYnIIJwowWtObiHFyktEYIUSz4BLAZ3IVoYfCwDTtoQrdt3XfT7-Gu6Vdh6OGwaXyIHfTRfQ5uYxqXLsGZ121yV8c9BW-PD6_zRbF8eXqez5aFIZL2BfVCS8KczGO1NiYfFRXM1ZX1NeeIEesc1bUkyFqJhcaUW2uYqyRnhtMpuD34rnSrtrHpdNyroBu1mC3VqCEmpECs_sKZvTmw2xhyztSrdRjiJsdTOYwgmDGOMnV3oEwMKUXnf20xUmOHauxQjR0qKjJeHnHdvcfGfrg_138ffgCvqXKH</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2937214450</pqid></control><display><type>article</type><title>A word of low complexity without uniform frequencies</title><source>Cambridge University Press:Jisc Collections:Cambridge University Press Read and Publish Agreement 2021-24 (Reading list)</source><creator>CASSAIGNE, JULIEN ; KABORÉ, IDRISSA</creator><creatorcontrib>CASSAIGNE, JULIEN ; KABORÉ, IDRISSA</creatorcontrib><description>In this paper, we construct a uniformly recurrent infinite word of low complexity without uniform frequencies of letters. This shows the optimality of a bound of Boshernitzan, which gives a sufficient condition for a uniformly recurrent infinite word to admit uniform frequencies.</description><identifier>ISSN: 0143-3857</identifier><identifier>EISSN: 1469-4417</identifier><identifier>DOI: 10.1017/etds.2023.37</identifier><language>eng</language><publisher>Cambridge, UK: Cambridge University Press</publisher><subject>Codes ; Complexity ; Mathematics ; Original Article</subject><ispartof>Ergodic theory and dynamical systems, 2024-04, Vol.44 (4), p.1013-1025</ispartof><rights>The Author(s), 2023. Published by Cambridge University Press</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c293t-3f7a924e9999daacc9246374e86df855042dee3a8920dd917a135ddc4e6954c53</cites><orcidid>0000-0002-5342-1808</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.cambridge.org/core/product/identifier/S0143385723000378/type/journal_article$$EHTML$$P50$$Gcambridge$$H</linktohtml><link.rule.ids>230,314,780,784,885,27923,27924,72731</link.rule.ids><backlink>$$Uhttps://hal.science/hal-04797048$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>CASSAIGNE, JULIEN</creatorcontrib><creatorcontrib>KABORÉ, IDRISSA</creatorcontrib><title>A word of low complexity without uniform frequencies</title><title>Ergodic theory and dynamical systems</title><addtitle>Ergod. Th. Dynam. Sys</addtitle><description>In this paper, we construct a uniformly recurrent infinite word of low complexity without uniform frequencies of letters. This shows the optimality of a bound of Boshernitzan, which gives a sufficient condition for a uniformly recurrent infinite word to admit uniform frequencies.</description><subject>Codes</subject><subject>Complexity</subject><subject>Mathematics</subject><subject>Original Article</subject><issn>0143-3857</issn><issn>1469-4417</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNptkEtLAzEUhYMoWKs7f0DAleCMeU4my1LUCgU3ug4xDztlpqnJjLX_3gwtuvFuLvfw3cPhAHCNUYkRFveut6kkiNCSihMwwaySBWNYnIIJwowWtObiHFyktEYIUSz4BLAZ3IVoYfCwDTtoQrdt3XfT7-Gu6Vdh6OGwaXyIHfTRfQ5uYxqXLsGZ121yV8c9BW-PD6_zRbF8eXqez5aFIZL2BfVCS8KczGO1NiYfFRXM1ZX1NeeIEesc1bUkyFqJhcaUW2uYqyRnhtMpuD34rnSrtrHpdNyroBu1mC3VqCEmpECs_sKZvTmw2xhyztSrdRjiJsdTOYwgmDGOMnV3oEwMKUXnf20xUmOHauxQjR0qKjJeHnHdvcfGfrg_138ffgCvqXKH</recordid><startdate>20240401</startdate><enddate>20240401</enddate><creator>CASSAIGNE, JULIEN</creator><creator>KABORÉ, IDRISSA</creator><general>Cambridge University Press</general><general>Cambridge University Press (CUP)</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7U5</scope><scope>8FD</scope><scope>H8D</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0002-5342-1808</orcidid></search><sort><creationdate>20240401</creationdate><title>A word of low complexity without uniform frequencies</title><author>CASSAIGNE, JULIEN ; KABORÉ, IDRISSA</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c293t-3f7a924e9999daacc9246374e86df855042dee3a8920dd917a135ddc4e6954c53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Codes</topic><topic>Complexity</topic><topic>Mathematics</topic><topic>Original Article</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>CASSAIGNE, JULIEN</creatorcontrib><creatorcontrib>KABORÉ, IDRISSA</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>Technology Research Database</collection><collection>Aerospace Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Ergodic theory and dynamical systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>CASSAIGNE, JULIEN</au><au>KABORÉ, IDRISSA</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A word of low complexity without uniform frequencies</atitle><jtitle>Ergodic theory and dynamical systems</jtitle><addtitle>Ergod. Th. Dynam. Sys</addtitle><date>2024-04-01</date><risdate>2024</risdate><volume>44</volume><issue>4</issue><spage>1013</spage><epage>1025</epage><pages>1013-1025</pages><issn>0143-3857</issn><eissn>1469-4417</eissn><abstract>In this paper, we construct a uniformly recurrent infinite word of low complexity without uniform frequencies of letters. This shows the optimality of a bound of Boshernitzan, which gives a sufficient condition for a uniformly recurrent infinite word to admit uniform frequencies.</abstract><cop>Cambridge, UK</cop><pub>Cambridge University Press</pub><doi>10.1017/etds.2023.37</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0002-5342-1808</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0143-3857
ispartof Ergodic theory and dynamical systems, 2024-04, Vol.44 (4), p.1013-1025
issn 0143-3857
1469-4417
language eng
recordid cdi_hal_primary_oai_HAL_hal_04797048v1
source Cambridge University Press:Jisc Collections:Cambridge University Press Read and Publish Agreement 2021-24 (Reading list)
subjects Codes
Complexity
Mathematics
Original Article
title A word of low complexity without uniform frequencies
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T10%3A17%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20word%20of%20low%20complexity%20without%20uniform%20frequencies&rft.jtitle=Ergodic%20theory%20and%20dynamical%20systems&rft.au=CASSAIGNE,%20JULIEN&rft.date=2024-04-01&rft.volume=44&rft.issue=4&rft.spage=1013&rft.epage=1025&rft.pages=1013-1025&rft.issn=0143-3857&rft.eissn=1469-4417&rft_id=info:doi/10.1017/etds.2023.37&rft_dat=%3Cproquest_hal_p%3E2937214450%3C/proquest_hal_p%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c293t-3f7a924e9999daacc9246374e86df855042dee3a8920dd917a135ddc4e6954c53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2937214450&rft_id=info:pmid/&rft_cupid=10_1017_etds_2023_37&rfr_iscdi=true