ρ-Frequently Hypercyclic Operators
Abstract: The concept of ρ-frequent hypercyclicity is introduced in order to provide a refined form of frequent hypercyclicity. This is achieved by replacing the denominator in the definition of frequent hypercyclicity by an appropriately chosen calibration function ρ. A ρ-Frequent Hypercyclicity Criterion is determined and the ρ-frequent hypercyclicity of weighted backward shifts is investigated.
Sign up to identify related papers:
Summary
- The paper introduces ho-frequency hypercyclicity, defined by a characterization asserting positive lower ho-density with a limit infimum, adding structure-based method for measuring how frequently a bounded backward shift hypercycles, agreeing with known ergodic continuous function properties and density calculus.
- Researchers demonstrated a $ ho$-Frequent Hypercyclicity Criterion, extending the Frequent Universality Criterion to $ ho$-frequencies of hypercyclic operators, applicable for separating slopes in logarithmic especial specifics as Bayart-Grivaux and Ernst-Mouze.
- The theory applies to weighted backward shifts on $\ell^p(\mathbb{N})$, showing a shift to be $\rho$-frequently hypercyclic under given uniform conditions for weights; an open question concerns necessity of the uniform condition, potentially connecting back to comparing Erdős–Sárközy and Vandiver dense/frequent return sets.
The paper introduces ρ-frequent hypercyclicity, a refinement of frequent hypercyclicity in linear dynamics obtained by replacing the natural density in Bayart and Grivaux's original definition with a lower density calibrated by a slowly growing function ρ. The framework interpolates between ordinary hypercyclicity and frequent hypercyclicity, yields a ρ-Frequent Hypercyclicity Criterion, produces a necessary and sufficient condition for weighted backward shifts on ℓp(N) under a weight restriction, and demonstrates that distinct calibration functions give genuinely distinct notions of hypercyclicity.
Densities relative to a calibration function
A calibration function ρ:R+→R+ is continuous, strictly increasing, unbounded, Lip(1,1), concave, and has non-increasing ρ(t)/t; these properties need only hold for large t, and examples include tα (0<α<1), ρ0, ρ1, and ρ2. The lower ρ3-density of a set ρ4 is
ρ5
which recovers the classical lower density when ρ6. A basic lemma characterizes positive lower ρ7-density for a strictly increasing sequence ρ8: it holds if and only if ρ9 as ρ0, extending the familiar condition ρ1.
Central to the development is the sequence ρ2, which the authors identify as the canonical sequence of ρ3-density 1. Two structural facts about ρ4 carry the later arguments: it is strictly increasing, and it satisfies the convexity-type inequality ρ5, a consequence of concavity and the monotonicity of ρ6.
The ρ7-Frequent Hypercyclicity Criterion
An operator ρ8 on a separable infinite-dimensional Fréchet space is ρ9-frequently hypercyclic if some vector's return set to every nonempty open set has positive lower ℓp(N)0-density. The main criterion generalizes the Frequent Universality Criterion of Bonilla and Grosse-Erdmann: given a dense set ℓp(N)1 and maps ℓp(N)2 satisfying unconditional convergence conditions along the subsequence ℓp(N)3 — namely uniform unconditional convergence of ℓp(N)4 and ℓp(N)5, unconditional convergence of ℓp(N)6, and ℓp(N)7 — the sequence ℓp(N)8 is ℓp(N)9-frequently universal.
The proof is a reduction rather than an independent construction: the rescaled sequences satisfy the hypotheses of the original Frequent Universality Criterion, producing return times ρ:R+→R+0, and since ρ:R+→R+1, the return set contains a sequence of positive lower ρ:R+→R+2-density. Specializing to iterates of a single operator gives the ρ:R+→R+3-Frequent Hypercyclicity Criterion with conditions expressed through powers ρ:R+→R+4 and ρ:R+→R+5.
Weighted backward shifts on ρ:R+→R+6
For a weighted backward shift ρ:R+→R+7 on ρ:R+→R+8, ρ:R+→R+9, with weights (1,1)0 and (1,1)1, the criterion yields a clean sufficient condition: (1,1)2 is (1,1)3-frequently hypercyclic whenever, for each (1,1)4,
(1,1)5
converges uniformly in (1,1)6. Conditions ((1,1)7-i) and ((1,1)8-iii) hold automatically for shifts, so only this series condition matters. In the case (1,1)9 it reduces to ρ(t)/t0, known to be sufficient by Bayart–Grivaux and necessary by Bayart–Ruzsa via their extension of the Erdős–Sárközy difference-set theorem.
The paper establishes necessity of a matching condition for shifts with all weights ρ(t)/t1: ρ(t)/t2 is ρ(t)/t3-frequently hypercyclic if and only if
ρ(t)/t4
Necessity combines two ingredients: a standard proposition showing that any ρ(t)/t5-frequently hypercyclic shift admits a positive-lower-ρ(t)/t6-density sequence ρ(t)/t7 with ρ(t)/t8, and a Cauchy condensation argument showing that convergence along such a sequence forces convergence along the canonical sequence ρ(t)/t9. This result is the engine behind the separation examples below. The authors are explicit that the necessity of the full uniform condition for general weighted shifts remains open; the equivalence here relies on the restriction t0, which makes t1 non-increasing.
Separation across calibration functions
The theory would be vacuous if all calibration functions induced the same notion. Theorem on varying t2 shows they do not: if t3 where t4 is increasing and unbounded, there is a bounded weighted backward shift on t5 that is t6-frequently hypercyclic but not t7-frequently hypercyclic. For instance, there exists a bounded weighted backward shift that is t8-frequently hypercyclic but not frequently hypercyclic.
The construction sets most weights to 1 and assigns t9 at indices tα0, where tα1 comes from a combinatorial lemma guaranteeing tα2, at worst geometric decay tα3, divergence of tα4, and convergence of tα5. A counting estimate shows that between consecutive elements of tα6 the faster function tα7 crosses at least roughly tα8 integers of the form tα9, so the divergence of 0<α<10 forces 0<α<11 while 0<α<12. These examples are analogues of results of Ernst–Mouze, who produced operators that are logarithmically frequently hypercyclic but not frequently hypercyclic within their admissible-matrix framework.
Relation to existing formulations
The paper carefully situates 0<α<13-frequent hypercyclicity against the 0<α<14-frequent hypercyclicity of Bayart–Matheron, where return sets must be enumerable as sequences with 0<α<15, and against 0<α<16-frequent hypercyclicity of Gupta–Mundayadan (the case 0<α<17). The two viewpoints are dual: 0<α<18-density counts how often the orbit visits 0<α<19 up to time ρ00, while ρ01-boundedness measures how long one waits for the ρ02-th visit. They are not equivalent in general — the obstruction being slow growth of ρ03 or fast growth of ρ04 — and the paper gives explicit counterexamples in both directions using ρ05 and ρ06.
Equivalence does hold under doubling-type regularity. If ρ07 eventually, then positive lower ρ08-density coincides with ρ09-boundedness for ρ10; conversely, any increasing ρ11 with non-decreasing gaps and ρ12 generates, by piecewise-linear interpolation, a calibration function whose ρ13-density captures exactly the ρ14-bounded sequences. Consequently ρ15-frequent hypercyclicity is precisely ρ16-frequent hypercyclicity for ρ17, and the Gupta–Mundayadan separation theorem for ρ18 becomes a special case of the general separation theorem. An illustrative example gives weights ρ19, yielding a shift on ρ20 that is ρ21-frequently hypercyclic but not ρ22-frequently hypercyclic for any ρ23.
Finally, the collection of sets of positive lower ρ24-density forms a proper Furstenberg family, so ρ25-frequent hypercyclicity is a special case of ρ26-hypercyclicity (Bès–Menet–Peris–Puig) and of Kostić's ρ27-hypercyclicity.
Limitations and open questions
Two limitations are acknowledged explicitly. First, the necessary and sufficient condition ρ28 is proved only for shifts with ρ29; whether the uniform sufficient condition is necessary for arbitrary weighted backward shifts on ρ30 is left open, and its resolution for ρ31 required the substantial Erdős–Sárközy-type machinery of Bayart–Ruzsa, suggesting the general case may be difficult. Second, the separation examples are constructed on ρ32 rather than general ρ33, though the authors note straightforward modifications should extend them. The relationship between ρ34-density and ρ35-boundedness also remains incomplete outside the doubling regimes covered by the equivalence proposition.
Conclusion
The paper provides a coherent calibration-function framework for measuring how frequently a hypercyclic orbit returns to open sets, complete with a criterion adapted from Bonilla–Grosse-Erdmann, a sharp characterization for a natural class of weighted backward shifts, and concrete evidence that the resulting hierarchy of hypercyclicity notions is strict. Its main open problem — necessity of the uniform series condition for unrestricted weights — is the natural next target for this line of work.
Paper to Video (Beta)
No one has generated a video about this paper yet.
Whiteboard
No one has generated a whiteboard explanation for this paper yet.
Paper Prompts
Sign up for free to create and run prompts on this paper.
Top Community Prompts
Open Problems
We haven't generated a list of open problems mentioned in this paper yet.
Continue Learning
- What are the precise conditions under which the $\rho$-Frequent Hypercyclicity Criterion holds for operators other than weighted backward shifts?
- Can the methodology in this paper be applied to other types of dynamical systems beyond linear operators?
- How does the behavior of $\rho$-frequently hypercyclic operators change as the calibration function $\rho$ varies, and how can this variation be quantified?
- What is the relationship between $\rho$-frequent hypercyclicity and other forms of hypercyclicity, such as $(m_k)$-frequent and $q$-frequent hypercyclicity, in non-doubling regimes?
- Find recent papers about combining dynamic notions like infinite spinodal overlaps for arithmetical progression adjustments and the interstitial halving process of backward-shifted finite state scenarios.
Tweets
Sign up for free to view the 1 tweet with 0 likes about this paper.