2000 character limit reached
On the Hypercyclicity Criterion for operators of Read's type
Published 19 Aug 2019 in math.FA and math.DS | (1908.06712v1)
Abstract: Let $T$ be a so-called operator of Read's type on a (real or complex) separable Banach space, having no non-trivial invariant subset. We prove in this note that $T\oplus T$ is then hypercyclic, i.e. that $T$ satisfies the Hypercyclicity Criterion.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.