On the complexity of upper frequently hypercyclic vectors
Szymon Glab, Paolo Leonetti

TL;DR
This paper investigates the topological complexity of the set of upper frequently hypercyclic vectors for linear operators, improving known results and providing counterexamples to previous conjectures about their descriptive set-theoretic classification.
Contribution
It shows that the set of upper frequently hypercyclic vectors is always a $G_{ ext{delta} ext{sigma}}$-set, refines previous results, and constructs an example where this set is not $G_ ext{delta}$, answering an open question.
Findings
The set of upper frequently hypercyclic vectors is always a $G_{ ext{delta} ext{sigma}}$-set.
Counterexample showing the set need not be $G_ ext{delta}$.
Analysis of the differences between product and norm topologies for hypercyclicity.
Abstract
Given a continuous linear operator , where is a topological vector space, let be the set of upper frequently hypercyclic vectors, that is, the set of vectors such that has positive upper asymptotic density for all nonempty open sets . It is known that is a -set which is either empty or contains a dense -set. Using a purely topological proof, we improve it by showing that is always a -set. Bonilla and Grosse-Erdmann asked in [Rev. Mat. Complut. \textbf{31} (2018), 673--711] whether is always a -set. We answer such question in the negative, by showing that there exists a continuous linear operator for which is not a -set (hence not…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHolomorphic and Operator Theory · Mathematical Dynamics and Fractals · Rings, Modules, and Algebras
