SUBSHIFTS OF FINITE TYPE WITH A HOLE

DOI10.1017/S1446788722000052MaRDI QIDQ6172261zbMATH OpenFDO

Authors Haritha Cheriyath, Nikita Agarwal

Publication date 19 July 2023

Published in Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.11767

zbMATH Keywords

combinatoricscorrelation polynomial of wordsescape rateopen dynamical systemssubshifts of finite typesymbolic dynamics

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Combinatorics on words (68R15)

Abstract: This paper examines the relationship between the escape rate and the minimal period of the hole. We consider a subshift of finite type on $q$ symbols with a union of $t$ cylinders based at words of identical length $p$ as the hole. The escape rate into the hole relates to the asymptotic behavior of the number of words of fixed length that do not contain the fixed set of (forbidden) words at which the cylinders are based. We explore the relationship between the escape rate and $r(z)$, a rational function of the correlations between the forbidden words. In particular, we prove that there exists a constant $D(t,p)$ such that if $q>D(t,p)$, then the escape rate is faster for the hole with larger value of $r(z)$ evaluated at $D(t,p)$. Further, we consider two holes each of which is a union of cylinders based at words of equal length, having zero cross-correlation, and prove that the larger is the minimal period of the collection, the faster is the escape rate. However, when the cross-correlations are non-zero, we give examples to prove that this result fails to hold. Our results are more general than the existing ones known for maps conjugate to a full shift with a single cylinder as the hole. The existing results arise as a special case of our results.

Recommendations

• Maximal escape rate for shifts
• Pressure and escape rates for random subshifts of finite type
• Survivor sets in subshifts of finite type
• Product of expansive Markov maps with hole
• Faster than expected escape for a class of fully chaotic maps

Cites work

• An Introduction to Symbolic Dynamics and Coding
• Avoided strings in bacterial complete genomes and a related combinatorial problem
• Escape rates and Perron-Frobenius operators: open and closed dynamical systems
• Escape rates and physically relevant measures for billiards with small holes
• Expanding Maps on Sets Which are Almost Invariant: Decay and Chaos
• Hitting and escaping statistics: mixing, targets and holes
• scientific article; zbMATH DE number 3974323 (Why is no real title available?)
• Intrinsic Markov Chains
• Maximal Prefix-Synchronized Codes
• On the Perron root and eigenvectors associated with a subshift of finite type
• Product of expansive Markov maps with hole
• String overlaps, pattern matching, and nontransitive games
• Where and when orbits of chaotic systems prefer to go
• Where to place a hole to achieve a maximal escape rate
• Why escape is faster than expected

Cited in

(3)

• Subshifts of quasi-finite type
• Maximal escape rate for shifts
• Shifts of finite type obtained by forbidding a single pattern

This page was built for publication: SUBSHIFTS OF FINITE TYPE WITH A HOLE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6172261)