Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2005, Volume 2, Pages 14–22 (Mi semr14)  
This article is cited in 7 scientific papers (total in 7 papers)

Research papers

A lower bound for the arithmetical complexity of Sturmian words

A. È. Frid

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (197 kB) Citations (7)
References:
PDF
HTML
Abstract: We give an $O(n^3)$ lower bound for the arithmetical complexity of a Sturmian word, that is the number of words of length $n$ occuring in all arithmetic progressions of a Sturmian word. This result supplements the recent $O(n^3)$ upper bound for the same function by Cassaigne and Frid.
Received January 31, 2005, published March 5, 2005
Bibliographic databases:
Document Type: Article
UDC: 519.1
MSC: 68R15
Language: Russian
Citation: A. È. Frid, “A lower bound for the arithmetical complexity of Sturmian words”, Sib. Èlektron. Mat. Izv., 2 (2005), 14–22
Citation in format AMSBIB
\Bibitem{Fri05}
\by A.~\`E.~Frid
\paper A~lower bound for the arithmetical complexity of Sturmian words
\jour Sib. \`Elektron. Mat. Izv.
\yr 2005
\vol 2
\pages 14--22
\mathnet{http://mi.mathnet.ru/semr14}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2131762}
\zmath{https://zbmath.org/?q=an:1125.68091}
Linking options:
  • https://www.mathnet.ru/eng/semr14
  • https://www.mathnet.ru/eng/semr/v2/p14
    • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024