Papers
Topics
Authors
Recent
Search
2000 character limit reached

Repetition and recurrence times: Dual statements and short memory conditions

Published 26 Jun 2023 in cs.IT, math.IT, and math.PR | (2306.14703v4)

Abstract: By an analogy to the duality between the recurrence time and the longest match length, we introduce a quantity dual to the maximal repetition length, which we call the repetition time. Extending prior results, we sandwich the repetition time in terms of unconditional and conditional min-entropies. The condition for the upper bound resembles short memory in the sense developed in time series analysis. Our reasonings make a repeated use of dualities between so called times and so called counts that generalize the duality of the recurrence time and the longest match length. We also discuss the analogy of these results with the Wyner-Ziv/Ornstein-Weiss theorem, which sandwiches the recurrence time in terms of Shannon entropies.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.