On the shortest distance between orbits and the longest common substring problem (Q1710399)

From MaRDI portal
Revision as of 22:45, 17 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the shortest distance between orbits and the longest common substring problem
scientific article

    Statements

    On the shortest distance between orbits and the longest common substring problem (English)
    0 references
    0 references
    0 references
    0 references
    22 January 2019
    0 references
    The authors show that under some rapidly mixing conditions, the decay of the shortest distance between orbits depends on the correlation dimension. This conclusion may change in the case of irrational rotations, depending on the irrational exponent of the angle of rotation. Moreover, they extend their findings from sequences matching to \(\alpha\)-mixing random processes with exponential decay.
    0 references
    Diophantine approximation
    0 references
    decay of correlations
    0 references
    Rényi entropy
    0 references
    correlation dimension
    0 references
    shortest distance
    0 references
    longest common substring
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references