Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-27T04:53:43.291Z Has data issue: false hasContentIssue false
  • English
  • Français

Shadowing, thick sets and the Ramsey property

Published online by Cambridge University Press:  09 January 2015

PIOTR OPROCHA
PIOTR OPROCHA*
Affiliation:
Faculty of Applied Mathematics, AGH University of Science and Technology, al. A. Mickiewicza 30, 30-059, Kraków, Poland email [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We provide a full characterization of relations between the shadowing property and the thick shadowing property. We prove that they are equivalent properties for non-wandering systems, the thick shadowing property is always a consequence of the shadowing property, and the thick shadowing property on the chain-recurrent set and the thick shadowing property are the same properties. We also provide a full characterization of the cases when for any family ${\mathcal{F}}$ with the Ramsey property an arbitrary sequence of points can be ${\it\varepsilon}$-traced over a set from ${\mathcal{F}}$.

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 36 , Issue 5 , August 2016 , pp. 1582 - 1595
Copyright
© Cambridge University Press, 2015 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Akin, E. and Kolyada, S.. LiYorke sensitivity. Nonlinearity 16 (2003), 1421–1433.Google Scholar
Aoki, N. and Hiraide, K.. Topological Theory of Dynamical Systems. North-Holland, Amsterdam, 1994.Google Scholar
Bergelson, V., Hindman, N. and McCutcheon, R.. Notions of size and combinatorial properties of quotient sets in semigroups. Topology Proc. 23 (1998), 23–60.Google Scholar
Brian, W., Meddaugh, J. and Raines, B.. Chain transitivity and variations of the shadowing property. Ergod. Th. & Dynam. Sys. published online, http://dx.doi.org/10.1017/etds.2014.21.Google Scholar
Clay, J. P.. Proximity relations in transformation groups. Trans. Amer. Math. Soc. 108 (1963), 88–96.Google Scholar
Dastjerdi, D. A. and Hosseini, M.. Sub-shadowings. Nonlinear Anal. 72 (2010), 3759–3766.Google Scholar
Furstenberg, H.. Recurrence in Ergodic Theory and Combinatorial Number Theory. Princeton University Press, Princeton, NJ, 1981.Google Scholar
Fakhari, A. and Gane, F. H.. On shadowing: ordinary and ergodic. J. Math. Anal. Appl. 364 (2010), 151–155.Google Scholar
Kurka, P.. Topological and Symbolic Dynamics. Société Mathématique de France, Paris, 2003.Google Scholar
Lind, D. and Marcus, B.. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge, 1995.Google Scholar
Moothathu, T. K. S.. Syndetically proximal pairs. J. Math. Anal. Appl. 379 (2011), 656–663.Google Scholar
Oprocha, P., Dastjerdi, D. and Hosseini, M.. On partial shadowing of complete pseudo-orbits. J. Math. Anal. Appl. 411 (2014), 454–463.Google Scholar
Richeson, D. and Wiseman, J.. Chain recurrence rates and topological entropy. Topology Appl. 156 (2008), 251–261.Google Scholar
Robinson, C.. Stability theorems and hyperbolicity in dynamical systems. Rocky Mountain J. Math. 7 (1977), 425–437.Google Scholar