Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Shadowing, asymptotic shadowing and s-limit shadowing (1701.05383v2)

Published 19 Jan 2017 in math.DS

Abstract: We study three notions of shadowing: classical shadowing, limit (or asymptotic) shadowing, and s-limit shadowing. We show that classical and s-limit shadowing coincide for tent maps and, more generally, for piecewise linear interval maps with constant slopes, and are further equivalent to the linking property introduced by Chen in 1991. We also construct a system which exhibits shadowing but not limit shadowing, and we study how shadowing properties transfer to maximal transitive subsystems and inverse limits (sometimes called natural extensions). Where practicable, we show that our results are best possible by means of examples.

Summary

We haven't generated a summary for this paper yet.