Sbornik: Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Sb.:
Year:
Volume:
Issue:
Page:
Find






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


Sbornik: Mathematics, 2006, Volume 197, Issue 11, Pages 1697–1712
DOI: https://doi.org/10.1070/SM2006v197n11ABEH003818
(Mi sm1114)
 

This article is cited in 1 scientific paper (total in 1 paper)

Dynamical systems with low recurrence rate

I. D. Shkredov

M. V. Lomonosov Moscow State University
References:
Abstract: The question on the recurrence rate of a dynamical system in a metric space of finite Hausdorff measure is considered. For such systems upper bounds for the rate of simple recurrence are due to Boshernitzan and ones for the rate of multiple recurrence to the present author. The subject of the paper are lower bounds for the rate of multiple recurrence. More precisely, an example of a dynamical system (an odometer or a von Neumann transformation) with a low rate of multiple recurrence is constructed. Behrend's theorem on sets containing no arithmetic progressions is used in the proof.
Bibliography: 22 titles.
Received: 19.07.2005 and 25.05.2006
Russian version:
Matematicheskii Sbornik, 2006, Volume 197, Number 11, Pages 143–158
DOI: https://doi.org/10.4213/sm1114
Bibliographic databases:
UDC: 517.938
MSC: Primary 37A05; Secondary 37A45
Language: English
Original paper language: Russian
Citation: I. D. Shkredov, “Dynamical systems with low recurrence rate”, Mat. Sb., 197:11 (2006), 143–158; Sb. Math., 197:11 (2006), 1697–1712
Citation in format AMSBIB
\Bibitem{Shk06}
\by I.~D.~Shkredov
\paper Dynamical systems with low recurrence rate
\jour Mat. Sb.
\yr 2006
\vol 197
\issue 11
\pages 143--158
\mathnet{http://mi.mathnet.ru/sm1114}
\crossref{https://doi.org/10.4213/sm1114}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2437091}
\zmath{https://zbmath.org/?q=an:1152.37005}
\elib{https://elibrary.ru/item.asp?id=9311806}
\transl
\jour Sb. Math.
\yr 2006
\vol 197
\issue 11
\pages 1697--1712
\crossref{https://doi.org/10.1070/SM2006v197n11ABEH003818}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000245209100007}
\elib{https://elibrary.ru/item.asp?id=14762835}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-34147117156}
Linking options:
  • https://www.mathnet.ru/eng/sm1114
  • https://doi.org/10.1070/SM2006v197n11ABEH003818
  • https://www.mathnet.ru/eng/sm/v197/i11/p143
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математический сборник Sbornik: Mathematics
    Statistics & downloads:
    Abstract page:595
    Russian version PDF:226
    English version PDF:11
    References:50
    First page:3
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024