Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 2008, Volume 15, Issue 5, Pages 61–75 (Mi da550)  
This article is cited in 5 scientific papers (total in 5 papers)

Existence of an infinite word with a Rauzy graph sequence that contains a subsequence of homeomorphs of graphs of the given sequence

P. V. Salimov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (294 kB) Citations (5)
References:
PDF
HTML
Abstract: We investigate infinite words on a finite alphabet and prove that for any sequence of strongly connected directed graphs with maximal in and out vertices degrees that are equal to $s$ there exists a uniformly recurrent infinite word on a $s$-letters alphabet with a Rauzy graph sequence that contains a subsequence of homeomorphs of graphs of the given sequence. Bibl. 5.
Keywords: infinite words, uniform reccurancy, Rauzy graph, de Brain graphs.
Received: 14.04.2008
Revised: 18.08.2008
English version:
Journal of Applied and Industrial Mathematics, 2010, Volume 4, Issue 1, Pages 127–135
DOI: https://doi.org/10.1134/S1990478910010151
Bibliographic databases:
UDC: 519.101
Language: Russian
Citation: P. V. Salimov, “Existence of an infinite word with a Rauzy graph sequence that contains a subsequence of homeomorphs of graphs of the given sequence”, Diskretn. Anal. Issled. Oper., 15:5 (2008), 61–75; J. Appl. Industr. Math., 4:1 (2010), 127–135
Citation in format AMSBIB
\Bibitem{Sal08}
\by P.~V.~Salimov
\paper Existence of an infinite word with a~Rauzy graph sequence that contains a~subsequence of homeomorphs of graphs of the given sequence
\jour Diskretn. Anal. Issled. Oper.
\yr 2008
\vol 15
\issue 5
\pages 61--75
\mathnet{http://mi.mathnet.ru/da550}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2543155}
\zmath{https://zbmath.org/?q=an:1249.65280}
\elib{https://elibrary.ru/item.asp?id=11622928}
\transl
\jour J. Appl. Industr. Math.
\yr 2010
\vol 4
\issue 1
\pages 127--135
\crossref{https://doi.org/10.1134/S1990478910010151}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77949876684}
Linking options:
  • https://www.mathnet.ru/eng/da550
  • https://www.mathnet.ru/eng/da/v15/i5/p61
    • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:336
    Full-text PDF :129
    References:41
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024