Frequent hypercyclicity of random entire functions for the differentiation operator
Miika Nikula

TL;DR
This paper demonstrates that certain random entire functions are frequently hypercyclic for the differentiation operator, providing a simple probabilistic method to construct such functions with controlled growth rates.
Contribution
It introduces a new probabilistic construction of frequently hypercyclic entire functions for the differentiation operator using random power series.
Findings
Random entire functions are frequently hypercyclic for D under weak assumptions.
These functions can be constructed with near minimal growth rates.
The growth rate differs from the slowest possible by at most a logarithmic factor.
Abstract
In this note we study the random entire functions defined as power series with independent and identically distributed coefficients and show that, under very weak assumptions, they are frequently hypercyclic for the differentiation operator , . This gives a very simple probabilistic construction of -frequently hypercyclic functions in . Moreover we show that, under more restrictive assumptions on the distribution of the , these random entire functions have a growth rate that differs from the slowest growth rate possible for -frequently hypercyclic entire functions at most by a factor of a power of a logarithm.
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
TopicsMeromorphic and Entire Functions · Holomorphic and Operator Theory · Analytic and geometric function theory
