1 Introduction
Open dynamical systems or dynamical systems with a hole are of interest because of their dynamical properties and also their applications; see [Reference Bolding and Bunimovich2, Reference Bunimovich and Yurchenko5, Reference Froyland and Stancevic7, Reference Guibas and Odlyzko9]. In [Reference Pianigiani and Yorke16], Pianigiani and Yorke introduced such systems and also discussed the issue of the rate of the escape of orbits into the hole (known as the escape rate). A natural question in this context is whether and how the escape rate depends on the position and size of the hole. This question was first addressed by Bunimovich and Yurchenko [Reference Bunimovich and Yurchenko5]. Their study focuses on full shifts on finitely many symbols with a single cylinder as a hole. They prove that the escape is fastest through the hole whose minimal period is maximum. Their results are applicable and restricted to all maps conjugate to a full shift with a single cylinder as the hole. Similar results are not known to exist even for simple systems such as expansive Markov maps. Froyland and Stancevic [Reference Froyland and Stancevic7] and Haritha and Agarwal [Reference Haritha and Agarwal11] present exploratory numerical examples for other shift spaces such as subshifts of finite type. However, these papers do not provide general results.
When the underlying state space is a subshift of finite type, the problem of computing the escape rate into a Markov hole, which is a finite union of cylinders, reduces to computing
$f(n)$
, the number of words of length n, which do not contain any of the words from a given finite collection of words with symbols from a fixed set of symbols; see [Reference Bunimovich and Yurchenko5, Reference Haritha and Agarwal11]. The problem of computing
$f(n)$
has been extensively studied in the literature. This problem is of interest in its own right and has applications to probability theory and combinatorics; see [Reference Guibas and Odlyzko9, Reference Hao, Xie, Yu and Chen10, Reference Odlyzko14]. There is no explicit formula for
$f(n)$
, thus often one studies its generating function
$F(z)$
. Guibas and Odlyzko in [Reference Guibas and Odlyzko8, Reference Guibas and Odlyzko9] gave an explicit combinatorial method (see Theorem 2.3) to compute the generating function
$F(z)$
, using a system of linear equations involving q, the size of the symbol set, and
$r(z)$
, a rational function of the correlation polynomials between the words in the collection. The correlation polynomials capture overlapping between the words. The function
$F(z)$
is rational and its special form is helpful to understand the asymptotic behavior of
$f(n)$
. This explicit form of the generating function
$F(z)$
was used in [Reference Bunimovich and Yurchenko5] to study the escape rate of the shift map on the full shift on two symbols into a Markov hole (a single cylinder).
In this paper, we consider a general class of maps, those conjugate to an irreducible subshift of finite type, with finite unions of cylinders based at words of identical length as holes. We extend and generalize the results of [Reference Bunimovich and Yurchenko5, Reference Haritha and Agarwal11] for this setup. The results in these works follow as a special case of the results in our paper. Unlike the case of [Reference Bunimovich and Yurchenko5], when the hole corresponds to a union of cylinders, that is, when there is more than one forbidden word, the cross-correlations between each pair of forbidden words appear in the generating function, which makes the analysis harder. For a full shift on q symbols with a union of t cylinders based at words each of length p as the hole, we prove that there is a constant
$D(t,p)$
such that for all
$q>D(t,p)$
, the escape rate is faster into the hole when the value of the corresponding rational function
$r(z)$
evaluated at
$D(t,p)$
is larger. In particular, when the hole is a union of two cylinders,
$D(t,p)=3p^2+2$
. These results extend smoothly to subshifts of finite type with a finite union of cylinders as a hole.
We also explore the relationship between the escape rate into the hole and the minimal period of the hole (which is the same as the Poincaré recurrence time if the cross-correlations between words at which the cylinders describing the hole are based, are zero; see Remark 2.10). In Theorems 4.12 and 5.4, we consider two collections with the same number of words, each of equal length, having zero cross-correlations, and prove that the collection with the larger minimal period has the larger escape rate. We give counter-examples in Remark 4.13 discussing the violation of this result when the cross-correlations are nonzero.
1.1 Organization of the paper
In Section 2 we present some preliminaries on subshifts of finite type, the relationship between the escape rate into a hole (which is a union of cylinders) and the topological entropy, and the form of the corresponding generating function in terms of the size of the symbol set q and the associated correlation polynomials. We state the main results of this paper in Section 3, the proofs of which are presented in later sections. In Section 4 we consider a full shift as the underlying space and compare the escape rate into two holes which are unions of two cylinders based at words of equal length p. Theorems 4.2 and 4.8 give the relationship between the escape rate and the corresponding rational function
$r(z)$
with certain assumptions on p and q. Furthermore, in Theorem 4.12 we discuss the relationship between the minimal period of the hole and the escape rate. In Section 5 we generalize the results obtained in Section 4 when holes are unions of more than two cylinders. Theorems 5.2 and 5.4 are generalizations of Theorems 4.8 and 4.12, respectively. In Section 6, we discuss applications of the results obtained in Sections 4 and 5 to the case when the underlying space is an irreducible subshift of finite type. We give concluding remarks in Section 7.
2 Preliminaries
In this section we present the concepts, notation and definitions that we use throughout the paper.
2.1 Subshifts of finite type
Let
$\Sigma =\{0,1,\ldots ,q-1\}$
be a set of symbols with
$q\geq 2$
. We denote by
$\Sigma ^{\mathbb {N}}$
the set of all one-sided sequences with symbols from
$\Sigma $
. This is known as a one-sided full shift on q symbols. Let
${\mathcal {F}}$
be a finite collection of words with symbols from
$\Sigma $
. The collection of all sequences from
$\Sigma ^{\mathbb {N}}$
which do not contain any of the words from the collection
${\mathcal {F}}$
as subwords is denoted by
$\Sigma _{\mathcal {F}}$
. This is known as a
$(p-1)$
-step subshift of finite type if the longest word in
${\mathcal {F}}$
has length
$p\ge 1$
. Without loss of generality, it can be assumed that each word in the collection
${\mathcal {F}}$
has length p. The words in the collection
${\mathcal {F}}$
are called forbidden. An allowed word in
$\Sigma _{\mathcal {F}}$
is a word which appears as a subword in some sequence in
$\Sigma _{\mathcal {F}}$
. Let
$\sigma :\Sigma _{\mathcal {F}}\to \Sigma _{\mathcal {F}}$
be the left shift map.
A zero-step subshift is a full shift on a smaller set of symbols. Every
$(p-1)$
-step subshift is conjugate to a one-step subshift via a block conjugacy map; see [Reference Lind and Marcus13].
An adjacency matrix of a one-step shift on q symbols is a binary matrix A of size q where the
$ij$
th entry is 1 if and only if
$ij$
is an allowed word. If A is an irreducible matrix, that is, for every
$i,j$
, there exists
$n\ge 1$
such that
$A^n_{i,j}>0$
, we say that the subshift is irreducible. It is said to be reducible if it is not irreducible. The subshift is said to be primitive if its adjacency matrix A is primitive, that is, there exists
$n\ge 1$
such that
$A^n>0$
.
A
$(p-1)$
-step subshift X is said to be irreducible (primitive) if the one-step subshift Y to which it is conjugate to is irreducible (primitive). Let A be the adjacency matrix of Y. For convenience, the adjacency matrix of X is also defined as A.
Let
$\Sigma _{\mathcal {F}}$
be an irreducible subshift of finite type. If
$f(n)$
denotes the number of words of length n which appear as subwords in sequences in
$\Sigma _{\mathcal {F}}$
, then the topological entropy of the subshift is given by
$ h_{\mathrm {top}}(\Sigma _{\mathcal {F}}) = \lim _{n \to \infty }\ln (f(n)^{1/n})= \ln (\theta ),$
where
$\theta $
is the largest (in modulus) eigenvalue of its adjacency matrix, which is real and positive by the Perron–Frobenius theorem, and is known as the Perron root.
2.2 The Parry measure
William Parry showed the existence and uniqueness of a
$\sigma $
-invariant measure of maximal entropy for irreducible subshifts of finite type; see [Reference Parry15]. This measure is now known as the Parry measure, which we now describe.
Consider an irreducible one-step subshift
$\Sigma _{\mathcal {F}}$
on q symbols. Let
$w=i_1i_2\cdots i_n$
be an allowed word in
$\Sigma _{\mathcal {F}}$
, and let
$$\begin{align*}C_w=\{x_1x_2\cdots\in\Sigma_{\mathcal{F}}\ \vert\ x_1=i_1,x_2=i_2,\ldots, x_n=i_n\} \end{align*}$$
be the cylinder based at the word w, which is the collection of all sequences in
$\Sigma _{\mathcal {F}}$
which begin with the word w. Then we obtain a probability measure space with set
$\Sigma _{\mathcal {F}}$
, the
$\sigma $
-algebra generated by the cylinders based at all allowed words in
$\Sigma _{\mathcal {F}}$
of finite length, and the measure
$\mu $
defined as follows: for every allowed word
$w=i_1i_2\cdots i_n$
,
$$\begin{align*}\mu(C_w)=\dfrac{u_{i_1}v_{i_n}}{\theta^{n-1}}, \end{align*}$$
where
$\theta $
is the Perron root of the adjacency matrix of
$\Sigma _{\mathcal {F}}$
, and
$v = (v_0,\ldots ,v_{q-1})^T$
and
$u = (u_0,\ldots ,u_{q-1})$
are the normalized right and left eigenvectors with respect to
$\theta $
such that
$u^Tv=1$
. The measure
$\mu $
is known as the Parry measure. This probability measure is invariant and ergodic with respect to the shift map
$\sigma $
on
$\Sigma _{\mathcal {F}}$
and is the unique measure that maximizes the measure-theoretic entropy according to the variational principle. Note that there is a large class of
$\sigma $
-invariant measures, known as Markov measures, on subshifts of finite type. The Parry measure is a special Markov measure; see [Reference Parry15].
In the case of full shift (
${\mathcal {F}}=\emptyset $
),
$\mu (C_w)=1/q^n$
, for all words w of length n. If
${\mathcal {F}}\ne \emptyset $
, it is immediate from the definition of
$\mu $
that two cylinders based at words of identical length need not have the same measure. On any subshift of finite type, we define the Parry measure using the conjugacy between the subshift and the one-step shift.
2.3 Escape rate
Consider an irreducible subshift of finite type
$\Sigma _{\mathcal {F}}$
with Parry measure
$\mu $
. Let
${\mathcal {G}}$
be a finite collection of allowed words in
$\Sigma_{\mathcal{F}}$
. Let
$H_{\mathcal {G}}=\bigcup _{w\in {\mathcal {G}}}C_w$
, referred to as a hole, denote the union of cylinders in
$\Sigma _{\mathcal {F}}$
based at words from
${\mathcal {G}}$
. The escape rate of the shift map
$\sigma \vert _{\Sigma _{\mathcal {F}}}$
into the hole
$H_{\mathcal {G}}$
is defined as
$$\begin{align*}\rho({\mathcal{G}};\Sigma_{\mathcal{F}}) := -\lim_{n\rightarrow \infty} \dfrac{1}{n} \ln\mu (\mathcal{W}_n({\mathcal{G}})), \end{align*}$$
where
$\mathcal {W}_n({\mathcal {G}})$
denotes the collection of all sequences in
$\Sigma _{\mathcal {F}}$
that do not contain words from
${\mathcal {G}}$
as subwords in their first n positions. In the case of a full shift, that is, when
${\mathcal {F}}=\emptyset $
, we use the shorthand
$\rho ({\mathcal {G}})$
for
$\rho ({\mathcal {G}};\Sigma _{\mathcal {F}})$
.
The notion of escape rate is quite general but we deal with subshifts of finite type in this paper, hence we restrict the definition to this setting only. Also the escape rate may not exist in general, but in the setting described in the above definition it does exist. It can be expressed in terms of the topological entropies of the subshifts
$\Sigma _{\mathcal {F}}$
and
$\Sigma _{{\mathcal {F}}\cup {\mathcal {G}}}$
.
Theorem 2.1 [Reference Haritha and Agarwal11, Theorem 3.1]
The escape rate
$\rho ({\mathcal {G}};\Sigma _{\mathcal {F}})$
can be expressed as
$$\begin{align*}\rho({\mathcal{G}};\Sigma_{\mathcal{F}})= h_{\mathrm{top}}(\Sigma_{\mathcal{F}}) - h_{\mathrm{top}}(\Sigma_{{\mathcal{F}}\cup {\mathcal{G}}}). \end{align*}$$
By this result, the problem of computing the escape rate turns into a purely combinatorial problem. Moreover, due to this result, the comparison of escape rates into two holes
$H_{{\mathcal {G}}_1}$
and
$H_{{\mathcal {G}}_2}$
in a given subshift of finite type
$\Sigma _{\mathcal {F}}$
with q symbols reduces to the comparison of the topological entropies of the subshifts
$\Sigma _{{\mathcal {F}}\cup {\mathcal {G}}_1}$
and
$\Sigma _{{\mathcal {F}}\cup {\mathcal {G}}_2}$
. This is further equivalent to comparing the escape rates into two holes
$H_{{\mathcal {F}}\cup {\mathcal {G}}_1}$
and
$H_{{\mathcal {F}}\cup {\mathcal {G}}_2}$
in the full shift on q symbols. Thus we consider the underlying space to be a full shift until Section 5. In Section 6 we consider subshifts of finite type.
2.4 Combinatorics on words
We now review some concepts from combinatorics on words which are used in due course (see [Reference Guibas and Odlyzko9]).
Definition 2.2. Let u and w be two words of lengths
$p_1$
and
$p_2$
, respectively, with symbols from
$\Sigma $
. The correlation polynomial of u and w is defined as
$$\begin{align*}(u,w)_z = \sum_{\ell=1}^{p_1} b_\ell z^{p_1-\ell}, \end{align*}$$
where
$b_{\ell }=0$
if
$\sigma ^{\ell -1}(C_u)\cap C_w=\emptyset $
, and
$b_{\ell }=1$
otherwise, with
$C_u$
and
$C_w$
denoting the cylinders on
$\Sigma ^{\mathbb {N}}$
based at u and w, respectively.
When
$u=w$
,
$(u,u)_z$
is said to be the autocorrelation polynomial of u, and when
$u\neq w$
,
$(u,w)_z$
is said to be the cross-correlation polynomial of u and w.
Note that if
$\sigma ^{\ell -1}(C_u)\cap C_w=\emptyset $
, for all
$1\leq \ell \leq p_1$
, then
$(u,w)_z=0$
. Also, if
$u\neq w$
then
$b_1=0$
, and if
$u=w$
then
$b_1=1$
. Hence, for
$u\neq w$
,
$(u,w)_z$
is a polynomial with degree at most
$p_1-2$
, and
$(u,u)_z$
is a monic polynomial with degree exactly equal to
$p_1-1$
.
A collection
$\{w_1,w_2,\ldots ,w_t\}$
of words is said to be reduced if for any
$i\ne j$
,
$w_i$
is not a subword of
$w_j$
.
Let
${\mathcal {F}}=\{w_1,w_2,\ldots ,w_t\}$
be a reduced collection of words with symbols from
$\Sigma $
. Let
$f(n)$
denote the number of allowed words in
$\Sigma _{\mathcal {F}}$
and
$$ \begin{align*} F(z):=\sum_{n=0}^\infty f(n)z^{-n} \end{align*} $$
be the generating function for the sequence
$(f(n))_{n\ge 0}$
. The function
$F(z)$
is rational and its form is described in the following result.
Theorem 2.3 [Reference Guibas and Odlyzko8]
With notation as above,
$$ \begin{align*} F(z)=\dfrac{z}{z-q+r_{\mathcal{F}}(z)}, \end{align*} $$
where
$r_{\mathcal {F}}(z)$
is the sum of entries of the inverse of the correlation matrix function
$\mathcal {M}(z)=[(w_j,w_i)_z]_{i,j}$
.
Remarks 2.4. (1) If the length of each word in
${\mathcal {F}}$
is p, then the numerator of
$r_F(z)$
is a polynomial of degree
$(t-1)(p-1)$
and the denominator of
$r_F(z)$
is a polynomial of degree
$t(p-1)$
. The generating function
$F(z)$
is rational by Theorem 2.3.
(2) If
$(w_i,w_j)_z=0$
for all
$i\ne j$
, then
$r_{\mathcal {F}}(z)=\sum \nolimits _{i=1}^t 1/(w_i,w_i)_z$
.
The authors have proved in [Reference Haritha and Agarwal12] that the Perron root
$\theta $
of the subshift
$\Sigma _{\mathcal {F}}$
is the largest positive real pole of the generating function
$F(z)$
. The statement of the result is given below and we refer to [Reference Haritha and Agarwal12, Theorem 4.1] for the proof.
Theorem 2.5. Consider an irreducible subshift of finite type
$\Sigma _{\mathcal {F}}$
and let
$\ln \theta $
be its topological entropy. The (rational) generating function
$F(z)$
is analytic outside the closed disk centered at the origin with radius
$\theta $
. Moreover,
$\theta $
is a simple pole of F.
Remarks 2.6.
Corollary 2.7. Consider an irreducible subshift of finite type
$\Sigma _{\mathcal {F}}$
. Let
${\mathcal {G}}$
be a finite collection of words with symbols from
$\Sigma $
. Then
$\rho ({\mathcal {G}};\Sigma _{\mathcal {F}})=-\ln (\lambda /\theta )$
, where
$\theta $
and
$\lambda $
are the largest real poles of the generating functions corresponding to the collections
${\mathcal {F}}$
and
${\mathcal {F}}\cup {\mathcal {G}}$
, respectively.
Remark 2.8. By Theorem 2.3 and Corollary 2.7, if the underlying subshift of finite type is induced with the Parry measure then the escape rates into two holes with identical correlation function
$r(z)$
are the same. The following example illustrates that this may not be the case when the space is induced with a general Markov measure that is not the Parry measure. Consider the full shift on two symbols equipped with the Markov measure corresponding to the stochastic matrix
$\Big (\begin {smallmatrix} 1/3&2/3\\ 1/2&1/2 \end {smallmatrix}\Big )$
(we refer to [Reference Parry15] for the definition of a Markov measure). Consider two collections
${\mathcal {G}}_1=\{00,11\}$
and
${\mathcal {G}}_2=\{01,10\}$
. Let
$H_1$
and
$H_2$
be holes corresponding to
${\mathcal {G}}_1$
and
${\mathcal {G}}_2$
, respectively. The correlation functions
$r_{{\mathcal {G}}_1}(z), r_{{\mathcal {G}}_2}(z)$
satisfy
$r_{{\mathcal {G}}_1}(z)=r_{{\mathcal {G}}_2}(z)= ({z+1})/{2}$
, for all z. However, the escape rates are
$\rho ({\mathcal {G}}_1)= {\ln (3)}/{2}$
and
$\rho ({\mathcal {G}}_2)=\ln (2)$
.
2.5 Minimal period of a hole
Definition 2.9. Let
$\Sigma _{\mathcal {F}}$
be a subshift of finite type and let
${\mathcal {G}}$
be a finite collection of allowed words in
$\Sigma _{\mathcal {F}}$
. Let
$\tau _{{\mathcal {G}}}$
be the minimum of the periods of the periodic points in the hole
$H_{{\mathcal {G}}}=\bigcup _{u\in {\mathcal {G}}} C_{u}$
, under the shift map. We call
$\tau _{{\mathcal {G}}}$
the minimal period of the hole
$H_{{\mathcal {G}}}$
. If
${\mathcal {G}}$
contains only one word u, then we use the shorthand
$\tau _u$
for
$\tau _{\mathcal {G}}$
.
Remarks 2.10. (1) The minimal period of the hole
$H_{\mathcal {G}}$
is given by
$\tau _{{\mathcal {G}}}=\min _{u\in {\mathcal {G}}}\tau _{u}$
. For any finite word u of length p,
$1\leq \tau _u\leq p$
. If
$1\leq \tau _{u}\leq p-1$
, then the second largest degree of
$(u,u)_z$
is
$z^{p-1-\tau _{u}}$
. Moreover,
$(u,u)_z=z^{p-1}$
, if
$\tau _{u}=p$
.
(2) When all the cross-correlation polynomials between the forbidden words in
${\mathcal {G}}$
are zero,
$\tau _{{\mathcal {G}}}$
is the Poincaré recurrence time of
$H_{{\mathcal {G}}}$
. This need not be the case when the cross-correlation polynomials are nonzero. For example, when
${\mathcal {G}}=\{01000,10000\}$
, the Poincaré recurrence time of
$H_{{\mathcal {G}}}$
is 1, whereas
$\tau _{{\mathcal {G}}}=4$
.
3 Statement of main results
Here we state the main results of this paper; proofs are presented in later sections. The first set of results are for a full shift
$\Sigma ^{\mathbb {N}}$
on q symbols and discuss comparison of the escape rates into two holes, each corresponding to a union of two cylinders based at words of equal length
$p\ge 2$
. The techniques used in the proofs are different when
$p=2$
and when
$p\geq 3$
, hence we have separated these results. Let
$r_{{\mathcal {G}}_1}(z)$
and
$r_{{\mathcal {G}}_2}(z)$
denote the rational functions corresponding to the collections
${\mathcal {G}}_1$
and
${\mathcal {G}}_2$
, respectively, as described in Theorem 2.3.
Theorem 1. Let
$q\geq 2$
and
${\mathcal {G}}_1$
,
${\mathcal {G}}_2$
be collections each having two words of length
$2$
(
$p=2$
). If
$r_{{\mathcal {G}}_1}(2)<r_{{\mathcal {G}}_2}(2)$
, then
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
.
Theorem 2. Let
$p\geq 3$
,
$q>3p^2+2$
, and
${\mathcal {G}}_1$
,
${\mathcal {G}}_2$
be collections each having two words of length p. If
$r_{{\mathcal {G}}_1}(3p^2+2)<r_{{\mathcal {G}}_2}(3p^2+2)$
, then
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
.
The above results give the relationship between the escape rate and the rational function
$r(z)$
, and are proved in Section 4.1.
The next result is also for a full shift
$\Sigma ^{\mathbb {N}}$
and discusses the relationship between the minimal period of the hole and the escape rate when the hole corresponds to a union of two cylinders based at words of length p with zero cross-correlations. In this case, the minimal period is same as the Poincaré recurrence time, as was pointed out earlier. Let
$\tau _{{\mathcal {G}}_1}$
and
$\tau _{{\mathcal {G}}_2}$
denote the minimal period of the holes
$H_{{\mathcal {G}}_1}$
and
$H_{{\mathcal {G}}_2}$
, respectively. The proof of the next result is given in Section 4.2.
Theorem 4. Let
${\mathcal {G}}_1=\{u_1,u_2\}$
and
${\mathcal {G}}_2=\{w_1,w_2\}$
, where
$u_1$
,
$u_2$
,
$w_1$
, and
$w_2$
are words of equal length p with
$(u_i,u_j)_z=(w_i,w_j)_z=0$
, for
$1\leq i\neq j\leq 2$
. For
$p=2$
and
$q\geq 2$
, or for
$p\geq 3$
and
$q\geq 5$
, if
$\tau _{{\mathcal {G}}_1}<\tau _{{\mathcal {G}}_2}$
, then
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
.
Finally, we generalize the results stated above to the case when holes are unions of more than two cylinders.
Theorem 5. Suppose
${\mathcal {G}}_1$
and
${\mathcal {G}}_2$
are finite collections of t words each of length p with symbols from
$\Sigma $
. Then for
$p\geq 3$
, there exists a positive constant
$D=D(t,p)$
such that for all
$q> D$
, if
$r_{{\mathcal {G}}_1}(D)<r_{{\mathcal {G}}_2}(D)$
, then
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
.
Theorem 6. Suppose
$t\geq 2$
and
$q\geq 2$
satisfy
$(q-1)(t+1)-t q(1+1/q)^{t-1}\geq 0$
. Let
${\mathcal {G}}_1=\{u_1,u_2,\ldots ,u_t\}$
and
${\mathcal {G}}_2=\{w_1,w_2,\ldots ,w_t\}$
be such that
$u_i,w_i$
are words of equal length p with
$(u_i,u_j)_z=(w_i,w_j)_z=0$
for
$1\leq i\neq j\leq t$
. If
$\tau _{{\mathcal {G}}_1}<\tau _{{\mathcal {G}}_2}$
, then
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
. The above inequality holds true for
$q\geq t 2^{t-1}+1$
.
These results are proved in Sections 5.1 and 5.2, respectively.
4 Full shift with union of two cylinders as hole
In this section we consider a full shift
$\Sigma ^{\mathbb {N}}$
on q symbols with a hole which is a union of two cylinders based at words of identical length. In Theorems 4.2 and 4.8 we explore the relationship between the escape rate and the corresponding rational function
$r(z)$
. Furthermore, in Theorem 4.12 we discuss the relationship between the escape rate and the minimal period of the hole. Our results easily extend to the case when the hole is a union of more than two cylinders, which is discussed in Section 5. All the results are applicable to maps conjugate to a full shift, for instance, to a product of expansive Markov maps where the individual maps are conjugate to a full shift as discussed in [Reference Haritha and Agarwal11].
4.1 Relationship between the escape rate and the rational function
$r(z)$
For a finite collection
${\mathcal {G}}$
of words with symbols from
$\Sigma $
, let
$H_{{\mathcal {G}}}=\bigcup _{w\in {\mathcal {G}}} C_w$
, the union of cylinders based at words from
${\mathcal {G}}$
. We say that
$H_{\mathcal {G}}$
is a hole corresponding to the collection
${\mathcal {G}}$
. Let
$\rho ({\mathcal {G}})$
denote the escape rate of the shift map on the full shift
$\Sigma ^{\mathbb {N}}$
into the hole
$H_{\mathcal {G}}$
. We recall the following result for a full shift with a single cylinder as a hole.
Theorem 4.1 [Reference Bunimovich and Yurchenko5, Lemma 4.5.1]
Let
${\mathcal {G}}_1=\{w_1\}$
and
${\mathcal {G}}_1=\{w_2\}$
, where
$w_1$
and
$w_2$
are words of identical length. If
$(w_1,w_1)_q<(w_2,w_2)_q$
, then
$\rho ({\mathcal {G}}_2)<\rho ({\mathcal {G}}_1)$
, where
$(w,w)_q$
is the value of
$(w,w)_z$
evaluated at
$z=q$
.
Since the coefficients of the autocorrelation polynomials are either 0 or 1, if
$(w_1,w_1)_2>(w_2,w_2)_2$
then
$(w_1,w_1)_q>(w_2,w_2)_q$
for all
$q\geq 2$
, and hence by the preceding result,
$\rho ({\mathcal {G}}_2)>\rho ({\mathcal {G}}_1)$
. Consequently, for two fixed holes, the relation between the corresponding escape rates remains unchanged when the size of the symbol set is changed. Our aim is to extend this result to the situation where the hole is a union of cylinders based at words of identical length.
Let us consider the case when the hole corresponds to two words of identical length. Let
${\mathcal {G}}_1=\{u_1,w_1\}$
and
${\mathcal {G}}_2=\{u_2,w_2\}$
, where
$u_1\neq w_1,u_2\neq w_2$
are all words of length
$p\ge 2$
. We would like to compare the escape rates
$\rho ({\mathcal {G}}_1)$
and
$\rho ({\mathcal {G}}_2)$
of the shift map on the full shift
$\Sigma ^{\mathbb {N}}$
into the holes
$H_{{\mathcal {G}}_1}$
and
$H_{{\mathcal {G}}_2}$
corresponding to the collections
${\mathcal {G}}_1$
and
${\mathcal {G}}_2$
, respectively.
For
$i=1,2$
, let
$f_{i}(k)$
denote the number of words of length k with symbols from
$\Sigma $
which do not contain any of the words from the collection
${\mathcal {G}}_i$
as subwords, and let the generating function be
$F_i(z)=\sum \nolimits _{n=0}^\infty f_i(n)z^{-n}$
. By Theorem 2.3,
$$\begin{align*}F_{i}(z)=\dfrac{z}{z-q+r_{{\mathcal{G}}_i}(z)}, \end{align*}$$
where
$$\begin{align*}r_{{\mathcal{G}}_i}(z)=\dfrac{(u_i,u_i)_z+(w_i,w_i)_z-(u_i,w_i)_z-(w_i,u_i)_z}{(u_i,u_i)_z(w_i,w_i)_z-(u_i,w_i)_z(w_i,u_i)_z} \end{align*}$$
is the sum of the entries of the inverse of the correlation matrix function corresponding to
${\mathcal {G}}_i$
.
The escape rates into the holes corresponding to two forbidden words are given in Tables 1, 2 and 3. These tables show the relationship between the rational functions
$r(z)$
and the escape rate for
$p=2,3,5$
, and for certain values of q. In the tables,
$a, b, c, d, e, f$
are distinct symbols from
$\Sigma =\{0,1,\ldots ,q-1\}$
.
Table 1 Escape rate values for
$p=2$
and
$q=2,3,\ldots ,10$
. For all real
$z>1$
,
$r_{{\mathcal {G}}_1}(z) < r_{{\mathcal {G}}_2} (z) < r_{{\mathcal {G}}_3}(z)<r_{{\mathcal {G}}_4}(z)$
.
Table 2 Escape rate values for
$p=3$
and
$q=2,3,4,5$
. Here
$r_{{\mathcal {G}}_i}(z)<r_{{\mathcal {G}}_{i+1}}(z)$
, for all
$z>4$
.
Table 3 Escape rates corresponding to few collections of three words each of length
$5$
(
$p=5$
). Here
$r_{{\mathcal {G}}_i}(z)<r_{{\mathcal {G}}_{i+1}}(z)$
, for all real
$z>3$
.
Let us make a few observations at this point. In Table 2, where
$p=3$
, consider the collections
${\mathcal {G}}_2=\{aaa,aba\}$
and
${\mathcal {G}}_3=\{abb,bba\}$
. For all real values of
$z\ge 2$
,
$r_{{\mathcal {G}}_2}(z)<r_{{\mathcal {G}}_3}(z)$
. When
$q=2$
,
$\rho ({\mathcal {G}}_2)=\rho ({\mathcal {G}}_3)$
, however, for
$q=3,4,5$
,
$\rho ({\mathcal {G}}_2)<\rho ({\mathcal {G}}_3)$
. Also, in Table 3, where
$p=5$
, consider the collections
${\mathcal {G}}_5=\{bbabb,bbbab,bbbba\}$
and
${\mathcal {G}}_6=\{abbbb,bbbba,bbabb\}$
. For all real
$z\ge 3$
,
$r_{{\mathcal {G}}_5}(z)<r_{{\mathcal {G}}_6}(z)$
. When
$q=2$
,
$\rho ({\mathcal {G}}_5)>\rho ({\mathcal {G}}_6)$
, however, for
$q=3$
,
$\rho ({\mathcal {G}}_5)<\rho ({\mathcal {G}}_6)$
.
These tables suggest the following: (a) for any pair
$i,j$
, there exists a number
$q_0$
such that
$r_{{\mathcal {G}}_i}(z)-r_{{\mathcal {G}}_j}(z)$
has the same sign for all real
$z\ge q_0$
; and (b)
$\rho ({\mathcal {G}}_i)<\rho ({\mathcal {G}}_j)$
if
$r_{{\mathcal {G}}_i}(q_0)<r_{{\mathcal {G}}_j}(q_0)$
. Indeed we have Theorems 4.2 and 4.8 dealing with the cases
$p=2$
and
$p\ge 3$
, respectively.
Theorem 4.2. Let
$q\ge 2$
and
${\mathcal {G}}_1$
,
${\mathcal {G}}_2$
be the collections each having two words of length
$2$
. If
$r_{{\mathcal {G}}_1}(2)<r_{{\mathcal {G}}_2}(2)$
, then
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
.
Proof. The only possible collections with two words of length
$2$
are
$\{aa,bb\}$
,
$\{aa,ab\}$
,
$\{ab,ba\}$
,
$\{ab,ca\}$
,
$\{ab,bc\}$
,
$\{aa,bc\}$
,
$\{ab,cd\}$
, and
$\{ab,ac\}$
. Consequently, there are four possible forms for
$r(z)$
, given by
$$\begin{align*}r_1(z)=\dfrac{2}{z+1},\quad r_2(z)=\dfrac{2z-1}{z^2},\quad r_3(z)=\dfrac{2z+1}{z(z+1)},\quad r_4(z)=\dfrac{2}{z}. \end{align*}$$
The collections
$\{ab,ca\}$
,
$\{ab,bc\}$
,
$\{aa,bc\}$
,
$\{ab,cd\}$
and
$\{ab,ac\}$
, and hence the rational functions
$r_2$
,
$r_3$
and
$r_4$
are not possible when there are only two symbols (
$q=2$
), thus there is nothing to prove in this case. Therefore, we assume that
$q\ge 3$
. Here
$r_1(z)<r_2(z)<r_3(z)<r_4(z)$
, for all real
$z>1$
. We need to prove that
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)<\rho ({\mathcal {G}}_3)<\rho ({\mathcal {G}}_4)$
. By Theorems 2.1 and 2.5, this is equivalent to proving that
$\lambda _1>\lambda _2>\lambda _3>\lambda _4$
, where
$\lambda _i$
is the largest real zero of
$z-q+r_i(z)$
.
Note that for
$i=1,\ldots ,4$
, the largest real pole of
$F_i(z)$
is same as the largest real root of
$p_i(z)$
, where
$p_1(z)=z^2-(q-1)z-(q-2)$
,
$p_2(z)=z^3-qz^2+2z-1$
,
$p_3(z)=z^3-(q-1)z^2-(q-2)z+1$
and
$p_4(z)=z^2-qz+2$
. For each i,
$p_i(q-1)<0$
and
$p_i(q)>0$
. Hence,
$p_i$
has a real root
$\lambda _i\in (q-1,q)$
. We prove that
$\lambda _i$
is a simple root of
$p_i$
with largest modulus.
Let us analyze each polynomial separately. Since
$p_1(-1)>0$
, there exists a real root inside
$(-1,q-1)$
. Thus
$\lambda _1$
is simple and has largest modulus since
$p_1$
is a polynomial of degree
$2$
and
$q\ge 3$
. For
$q\ge 4$
, at
$\lvert z\rvert =q-1$
, note that
$q\lvert z\rvert ^2> \lvert z\rvert ^3+2\lvert z\rvert +1$
, and hence
$p_2(z)$
has two roots inside the ball of radius
$q-1$
, by Rouché’s theorem. Thus
$\lambda _2$
is the simple largest root of
$p_2$
. At
$q=3$
, it is immediate that
$\lambda _2$
is the largest root of
$p_2(z)=z^3-3z^2+2z-1$
. Since
$p_3(-1)<0$
,
$p_3(0)>0$
and
$p_3$
is a polynomial of degree
$3$
,
$\lambda _3$
is the largest root of
$p_3$
. Finally, since
$p_4(0)>0$
and
$p_4$
is a polynomial of degree
$2$
,
$\lambda _4$
is the largest root of
$p_4$
.
Note that
$\lambda _2p_1(\lambda _2)=\lambda _2^3-(q-1)\lambda _2^2-(q-2)\lambda _2=\lambda _2^2-q\lambda _2+1 <0$
, since
$\lambda _2(\lambda _2^2-q\lambda _2+1)=1-\lambda _2<0$
. Hence,
$p_1(\lambda _2)<0$
, which implies
$\lambda _2<\lambda _1$
. Similarly,
$p_3(\lambda _2)>0$
implies
$\lambda _3<\lambda _2$
, and
$p_3(\lambda _4)<0$
implies
$\lambda _4<\lambda _3$
, for
$q\ge 3$
. Thus we have the required result using Corollary 2.7.
Next we prove a series of lemmas required to obtain the main result, Theorem 4.8, which relates the escape rate and the rational function
$r(z)$
when a hole corresponds to a collection of two words of identical length. Let us first fix some notation. Let
$u,w$
be two distinct words both of length
$p\ge 2$
with symbols from
$\Sigma =\{0,1,\ldots ,q-1\}$
, and let
${\mathcal {G}}=\{u,w\}$
. Define
$$ \begin{align*} a(z) &:=(u,u)_z,\quad b(z):=(w,u)_z,\quad c(z):=(u,w)_z,\quad d(z):=(w,w)_z,\\ &{\mathcal{D}}(z):=a(z)d(z)-b(z)c(z),\quad \mathcal{S}(z):=a(z)+d(z)-b(z)-c(z). \end{align*} $$
Then the generating function
$F(z)$
corresponding to the collection
${\mathcal {G}}$
, as described in Theorem 2.3, is given by
$$ \begin{align} F(z)=\dfrac{z}{z-q+r(z)}=\dfrac{z{\mathcal{D}}(z)}{(z-q){\mathcal{D}}(z)+\mathcal{S}(z)}, \end{align} $$
where
$r(z)={\mathcal {S}(z)}/{{\mathcal {D}}(z)}$
is the rational function given by the sum of entries of
${\mathcal {M}}(z)^{-1}$
, where
${\mathcal {M}}(z)=\Big (\begin {smallmatrix} a(z)&b(z)\\c(z)&d(z) \end {smallmatrix}\Big )$
.
Observe that
$a,b,c,d$
are polynomial functions with coefficients either 0 or 1. The degree of both
$a(z)$
and
$d(z)$
is
$p-1$
, whereas the degree of both
$b(z)$
and
$c(z)$
is at most
$p-2$
. Hence,
${\mathcal {D}}(z)$
and
$\mathcal {S}(z)$
have degrees
$2(p-1)$
and
$p-1$
, respectively.
We show that for real z,
${\mathcal {D}}(z)>0$
, and thus from Theorem 2.5 the Perron root of the adjacency matrix for
$\Sigma _{\mathcal {G}}$
is the same as the largest real root of
$(z-q){\mathcal {D}}(z)+\mathcal {S}(z)$
. The following two lemmas give the location of this root on the real line.
Lemma 4.3. For
$p\ge 3$
and
$q\ge 5$
, the polynomial
$(z-q){\mathcal {D}}(z)+\mathcal {S}(z)$
has exactly one root outside the disk
$\vert z\vert <4$
.
Proof. Since
$a,b,c,d$
are polynomial functions with coefficients either 0 or 1, and the degree of both
$a(z)$
and
$d(z)$
is
$p-1$
, whereas the degree of both
$b(z)$
and
$c(z)$
is at most
$p-2$
, we have that
$$ \begin{align*} \vert a(z)\vert, \vert d(z)\vert &\ge \vert z\vert^{p-1}-\sum_{i=0}^{p-2}\vert z\vert^i \ge \vert z\vert^{p-1} \dfrac{\vert z\vert-2}{\vert z\vert-1},\\ \vert c(z)\vert, \vert b(z)\vert &\le \sum_{i=0}^{p-2}\vert z\vert^i\le \dfrac{\vert z\vert^{p-1}}{\vert z\vert-1}. \end{align*} $$
Hence, on the circle
$\vert z\vert =4$
,
$$ \begin{align*} \vert {\mathcal{D}}(z)\vert &\ge \vert a(z)\vert\vert d(z)\vert-\vert c(z)\vert\vert b(z)\vert \ge \vert z\vert^{2p-2}\bigg(\dfrac{\vert z\vert-2}{\vert z\vert-1}\bigg)^2-\dfrac{\vert z\vert^{2p-2}}{(\vert z\vert -1)^2}\\ &=\vert z\vert^{2p-2} \bigg(1-\dfrac{2}{\vert z\vert-1}\bigg) = \dfrac{1}{48} 4^{2p}>0,\\ \vert \mathcal{S}(z)\vert&\le \vert a(z)\vert+\vert d(z)\vert+\vert c(z)\vert+\vert b(z)\vert\le \dfrac{2}{\vert z\vert -1}\vert z\vert^{p-1} (\vert z \vert+1)= \dfrac{5}{6} 4^p. \end{align*} $$
Since
$q\ge 5$
and
$p\ge 3$
, on the circle
$\vert z\vert =4$
,
$$ \begin{align*} \dfrac{\vert z-q\vert\vert {\mathcal{D}}(z)\vert}{\vert \mathcal{S}(z)\vert}\ge \dfrac{\vert {\mathcal{D}}(z)\vert}{\vert \mathcal{S}(z)\vert}\ge \dfrac{1}{40}4^p>1. \end{align*} $$
Hence,
$\vert z-q\vert \vert {\mathcal {D}}(z)\vert>\vert \mathcal {S}(z)\vert $
on
$\vert z\vert =4$
. By Rouché’s theorem, both
$(z-q){\mathcal {D}}(z)$
and
$(z-q){\mathcal {D}}(z)+\mathcal {S}(z)$
, being of identical degrees, have the same number of zeros in the region
$\vert z\vert \ge 4$
.
Since
$\vert {\mathcal {D}}(z)\vert>0$
,
$z=q$
is the only zero of
$(z-q){\mathcal {D}}(z)$
, for
$\vert z\vert \ge 4$
, which gives the desired result.
Let
$\lambda \ge 4$
denote the unique real root of
$(z-q){\mathcal {D}}(z)+\mathcal {S}(z)$
obtained in Lemma 4.3. By Theorem 2.5,
$\lambda $
is same as the Perron root of the adjacency matrix of
$\Sigma _{\mathcal {G}}$
, since
${\mathcal {D}}(\lambda )> 0$
. By the Perron–Frobenius theorem,
$\lambda \le q$
. The following lemma discusses how close the Perron root
$\lambda $
is to q.
Lemma 4.4. For
$p\ge 3$
and
$q\ge 5$
,
$q-\lambda =O(q^{-p+2})$
.
Proof. Since
$\mathcal {S}(q)=a(q)+d(q)-b(q)-c(q)>2q^{p-1}-2 (({q^{p-1}-1})/({q-1})) >0$
, at
$z=q$
,
$(q-z){\mathcal {D}}(z)-\mathcal {S}(z)=-\mathcal {S}(q)<0$
. For real
$x\ge 2$
,
$$ \begin{align*} (q-x){\mathcal{D}}(x)-\mathcal{S}(x)&\ge (q-x)\bigg[x^{2p-2}-\dfrac{x^{2p-2}}{(x-1)^2}\bigg]-2\dfrac{x^p}{x-1}\\ &> \dfrac{x^{p+1}}{(x-1)^2} ((q-x)(x-2)x^{p-2}-2). \end{align*} $$
Moreover, at
$x=q-mq^{-p+2}$
,
$$ \begin{align*} (q-x)(x-2)x^{p-2}-2 &= mq^{-p+2} q^{p-2}(1-mq^{-p+1})^{p-2}(q-mq^{-p+2}-2)-2\\ &\ge m(1-m(p-2)q^{-p+1})(q-mq^{-p+2}-2)-2, \end{align*} $$
for
$p\ge 3$
,
$q\ge 5$
, since
$(1-x)^n\ge 1-nx$
, for
$x>0$
and
$n\ge 1$
.
Further since for
$p\ge 3$
,
$({p-2})/{q^{p-1}} < ({p-1})/{5^{p-1}} < \tfrac {1}{8}$
,
$$\begin{align*}m (1-m(p-2)q^{-p+1}) (q-mq^{-p+2}-2)-2>m\bigg(1-\dfrac{m}{8}\bigg)\bigg(3-\dfrac{m}{25}\bigg)-2. \end{align*}$$
For all values of m lying in the interval
$[0.8,1]$
, the last term is positive. Hence, we have
$(q-x){\mathcal {D}}(x)-\mathcal {S}(x)>0$
, for
$x=q-mq^{-p+2}$
. Thus
$$ \begin{align*} q-q^{-p+2}< q-mq^{-p+2} <\lambda < q, \end{align*} $$
and hence the result follows.
Remark 4.5. An ancillary result of the preceding lemma is that
$q-1<\lambda <q$
.
The above result leads to the following corollary which gives the existence of an arbitrarily large hole into which the escape rate is arbitrarily small.
Corollary 4.6. Let
$q\ge 5$
and
$x,y\in \Sigma ^{{\mathbb {N}}}$
. For any given
$\epsilon>0$
and
$\delta>0$
, there exists a collection
${\mathcal {G}}$
of words such that
$x,y\in H_{{\mathcal {G}}}$
,
$\mu (H_{{\mathcal {G}}})>1-\epsilon $
and
$\rho ({\mathcal {G}})<\delta $
.
Proof. Let
$x=x_1x_2\cdots $
,
$y=y_1y_2\cdots $
,
${\mathcal {G}}_p=\{u_p=x_1x_2\cdots x_p,w_p=y_1y_2\cdots y_p\}$
, and
${\mathcal {D}}_p(z)$
and
$\mathcal {S}_p(z)$
be as in (4-1) such that the rational function
$r_{p}(z)={\mathcal {S}_p(z)}/{{\mathcal {D}}_p(z)}$
.
By Lemma 4.4, for
$p\ge 3$
, the largest root
$\lambda _p$
of the polynomial
$(z-q){\mathcal {D}}_p(z)+\mathcal {S}_p(z)$
satisfies
$$\begin{align*}q-q^{-p+2}\le \lambda_p\le q. \end{align*}$$
Hence,
$\rho ({\mathcal {G}}_p)=-\ln (\lambda _p/q)\rightarrow 0$
as
$p\rightarrow \infty $
. Choose p large enough so that
$\rho ({\mathcal {G}}_p)<\delta $
. Since
$\sigma $
is ergodic with respect to the Parry measure
$\mu $
, there exists n such that
$\mu (\bigcup _{i=0}^n\sigma ^{-i}H_{{\mathcal {G}}_p})>1-\epsilon $
. Let
$H_{\mathcal {G}}=\bigcup _{i=0}^n\sigma ^{-i}H_{{\mathcal {G}}_p}$
. Using [Reference Bunimovich and Yurchenko5, Proposition 2.3.2],
$\rho ({\mathcal {G}})=\rho ({\mathcal {G}}_p)$
. This completes the proof.
The next result is used in the proof of Theorem 4.8.
Proposition 4.7. Let
$p\ge 3, q\ge 5$
, and
${\mathcal {G}}_1$
,
${\mathcal {G}}_2$
be collections each having two words of length p. If
$r_{{\mathcal {G}}_1}(x)<r_{{\mathcal {G}}_2}(x)$
for all
$x\in (q-q^{-p+2},q)$
, then
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
.
Proof. Let
${\mathcal {D}}_i(x)$
,
$\mathcal {S}_i(x)$
,
$r_{{\mathcal {G}}_i}(x)= {\mathcal {S}_i(x)}/{{\mathcal {D}}_i(x)}$
be as defined earlier, for the collection
${\mathcal {G}}_i$
,
$i=1,2$
. Let
$\lambda _i\in (q-q^{-p+2},q)$
be the largest root of
$(q-x){\mathcal {D}}_i(x)-\mathcal {S}_i(x)$
, for
$i=1,2$
. Then
$q-\lambda _i-r_{{\mathcal {G}}_i}(\lambda _i)=0$
,
$i=1,2$
.
Since
$r_{{\mathcal {G}}_1}(x)<r_{{\mathcal {G}}_2}(x)$
, for all
$x\in (q-q^{-p+2},q)$
, we have, in particular,
$r_{{\mathcal {G}}_1}(\lambda _1)<r_{{\mathcal {G}}_2}(\lambda _1)$
and
$r_{{\mathcal {G}}_1}(\lambda _2)<r_{{\mathcal {G}}_2}(\lambda _2)$
. Consider the equation
$q-x-r_{{\mathcal {G}}_2}(x)$
. At
$x=\lambda _1$
,
$$ \begin{align*} q-\lambda_1-r_{{\mathcal{G}}_2}(\lambda_1)&= q-\lambda_1-r_{{\mathcal{G}}_2}(\lambda_1)- (q-\lambda_1-r_{{\mathcal{G}}_1}(\lambda_1))\\ &= r_{{\mathcal{G}}_1}(\lambda_1)-r_{{\mathcal{G}}_2}(\lambda_1)<0. \end{align*} $$
Since at
$x=q-q^{-p+2}$
,
$q-x-r_{{\mathcal {G}}_2}(x)>0$
, and
$\lambda _2$
is the unique root of
$q-x-r_{{\mathcal {G}}_2}(x)$
greater than
$q-q^{-p+2}$
, we obtain
$\lambda _2<\lambda _1$
. Hence,
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
using Corollary 2.7.
We now prove our main theorem which relates the escape rate and the rational function when the hole is a union of two cylinders based at words of identical length.
Theorem 4.8. Let
$p\ge 3$
,
$q>3p^2+2$
, and
${\mathcal {G}}_1$
,
${\mathcal {G}}_2$
be the collections each having two words of length p. If
$r_{{\mathcal {G}}_1}(3p^2+2)<r_{{\mathcal {G}}_2}(3p^2+2)$
, then
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
.
Proof. For
$i=1,2$
, let
${\mathcal {G}}_i=\{u_i,w_i\}$
. Define
$f_i(z):=(u_i,u_i)_z$
,
$g_i(z):=(w_i,w_i)_z$
,
$h_i(z):=(u_i,w_i)_z$
,
$k_i(z):=(w_i,u_i)_z$
,
${\mathcal {D}}_i(z):=f_i(z)g_i(z)-h_i(z)k_i(z)$
,
$\mathcal {S}_i(z):=f_i(z)+g_i(z)-h_i(z)-k_i(z)$
, and then the rational function
$r_{{\mathcal {G}}_i}(z)= {\mathcal {S}_i(z)}/{{\mathcal {D}}_i(z)}$
.
Let
$\lambda _i$
be the largest real root of the polynomial
$(q-x){\mathcal {D}}_i(x)-\mathcal {S}_i(x)$
. We show that if
$r_{{\mathcal {G}}_1}(3p^2+2)<r_{{\mathcal {G}}_2}(3p^2+2)$
, then
$r_{{\mathcal {G}}_1}(x)<r_{{\mathcal {G}}_2}(x)$
for all
$x\ge 3p^2+2$
. Proposition 4.7 will then imply that
$\lambda _1>\lambda _2$
, for all
$q>3p^2+2$
.
The zeros of
$(r_1-r_2)(x)$
are the same as the zeros of
$({\mathcal {D}}_2\mathcal {S}_1-{\mathcal {D}}_1\mathcal {S}_2)(x)$
, which is a polynomial with integer coefficients. We show that the absolute value of each coefficient of
$({\mathcal {D}}_2\mathcal {S}_1-{\mathcal {D}}_1\mathcal {S}_2)(x)$
is bounded above by
$3p^2+1$
. Hence, by the Lagrange bound on the zeros of a polynomial, all the roots of
$(r_1-r_2)(x)$
lie in the disc of radius
$3p^2+2$
.
Since
$f_i,g_i,h_i,k_i$
are polynomials with coefficients either 0 or 1, the degree of
$f_i,g_i$
is
$p-1$
, and the degree of
$h_i,k_i$
is at most
$p-2$
, if
${\mathcal {D}}_i(x)=\sum \nolimits _{\ell =0}^{2p-2}a_{i,\ell } x^\ell $
and
$\mathcal {S}_i(x)=\sum \nolimits _{m=0}^{p-1}b_{i,m} x^m$
, then
$$\begin{align*}\lvert a_{i,\ell}\rvert \leq \begin{cases} \ell+1 & 0\leq \ell\leq p-1 \\ 2p-(\ell+1) & p\leq \ell\leq 2p-2, \end{cases} \end{align*}$$
and
$\lvert b_{i,m}\rvert \leq 2$
for
$0\leq m\leq p-1$
. Now,
$$\begin{align*}{\mathcal{D}}_i\mathcal{S}_j(x)=\sum_{n=0}^{3p-3}\bigg(\sum_{\ell+m=n}a_{i,\ell}b_{j,m}\bigg)x^n. \end{align*}$$
The maximum of the upper bounds for the coefficients
$\sum \nolimits _{\ell +m=n}a_{i,\ell }b_{j,m}$
is at
$n=p+ {p}/{2} -1$
when p is even, and at
$n=p+ ({p-1})/{2} -1$
when p is odd, and the maximum values are
${3p^2}/{2}$
and
$({3p^2+1})/{2}$
, respectively. Hence, in general, for every
$0\leq n\leq 3p-3$
,
$$\begin{align*}\bigg\lvert \sum_{l+m=n}a_{i,\ell}b_{j,m} \bigg\rvert \leq \dfrac{3p^2+1}{2}. \end{align*}$$
This implies that the absolute value of each coefficient of
${\mathcal {D}}_1\mathcal {S}_2-{\mathcal {D}}_2\mathcal {S}_1$
is bounded above by
$3p^2+1$
.
Remark 4.9. When the hole is a union of two cylinders based at words of identical length, then the cross-correlations between the words play an important role.
For instance, consider
${\mathcal {G}}_1=\{012\}$
,
$\mathcal {H}_1=\{123\}$
,
${\mathcal {G}}_2=\{102\}$
, and
$\mathcal {H}_2=\{333\}$
. Here
$\rho ({\mathcal {G}}_1)=\rho ({\mathcal {G}}_2)$
and
$\rho (\mathcal {H}_1)>\rho (\mathcal {H}_2)$
, but
$\rho ({\mathcal {G}}_1\cup \mathcal {H}_1)<\rho ({\mathcal {G}}_2\cup \mathcal {H}_2)$
.
So far in this section we have assumed that the hole is a union of two cylinders based at words of identical length. In the following result, we allow for a hole to be the union of two cylinders based at words of different lengths.
Theorem 4.10. Let
$p_1,p_2\ge 3$
,
$q>3p_1p_2+2$
, and
${\mathcal {G}}_1,{\mathcal {G}}_2$
be two collections of words each containing two words of lengths
$p_1$
and
$p_2$
. If
$r_{{\mathcal {G}}_1}(3p_1p_2+2)<r_{{\mathcal {G}}_2}(3p_1p_2+2)$
, then
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
.
Proof. For a hole
$H_{\mathcal {G}}$
corresponding to the collection
${\mathcal {G}}$
consisting of two words of lengths
$p_1$
and
$p_2$
, let
$a,b,c,d,{\mathcal {D}},\mathcal {S}$
be as defined earlier. We follow the steps as in the proof of Theorem 4.8. Without loss of generality, we assume that
$p_1>p_2$
. The following statements hold true for
$p_1,p_2\ge 3$
,
$q\ge 5$
.
-
• On
$\vert z\vert =4$
,
$({\vert z-q\vert \vert {\mathcal {D}}(z)\vert })/{\vert \mathcal {S}(z)\vert } \ge ({1}/{20})({4^{p_1+p_2}}/{4^{p_1}+4^{p_2}})> 1$
. Hence, as in Lemma 4.3, the polynomial
$(z-q){\mathcal {D}}(z)+\mathcal {S}(z)$
has exactly one real positive root
$\lambda>4$
. -
•
$q-\lambda =O(q^{-p_2+2})$
. -
• If
$r_{{\mathcal {G}}_1}(x)<r_{{\mathcal {G}}_2}(x)$
for all
$x\in (q-q^{-p_2+2},q)$
, then
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
. -
• The absolute value of all the zeros of
$r_{{\mathcal {G}}_1}-r_{{\mathcal {G}}_2}$
has an upper bound equal to
$3p_1p_2+2$
.
4.2 Relationship between the escape rate and minimal period of the hole
We recall a result from [Reference Bunimovich and Yurchenko5] which gives the relationship between the minimal period (Definition 2.9) and the escape rate into a single cylinder on a full shift.
Theorem 4.11 [Reference Bunimovich and Yurchenko5, Theorem 4.0.8]
Let
${\mathcal {G}}_1=\{u_1\}$
and
${\mathcal {G}}_2=\{u_2\}$
, where
$u_1$
and
$u_2$
are words of identical length. If
$\tau _{{\mathcal {G}}_1}<\tau _{{\mathcal {G}}_2}$
, then
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
.
This result is immediate from Theorem 4.1 since
$\tau _{{\mathcal {G}}_1}<\tau _{{\mathcal {G}}_2}$
implies
$(u_1,u_1)_q> (u_2,u_2)_q$
, which in turn implies
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
. Theorem 4.12 extends this result to the case when holes are unions of two cylinders with the extra assumption that the cross-correlation polynomials between the forbidden words are zero. With this extra assumption, the minimal period is same as the Poincaré recurrence time. Later we show that this assumption is necessary.
Theorem 4.12. Let
${\mathcal {G}}_1=\{u_1,u_2\}$
and
${\mathcal {G}}_2=\{w_1,w_2\}$
, where
$u_1$
,
$u_2$
,
$w_1$
and
$w_2$
are words of equal length p. Let
$(u_i,u_j)_z=(w_i,w_j)_z=0$
, for
$1\le i\neq j\le 2$
. For
$p=2$
and
$q\ge 2$
, or for
$p\ge 3$
and
$q\ge 5$
, if
$\tau _{{\mathcal {G}}_1}<\tau _{{\mathcal {G}}_2}$
, then
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
.
Proof. It is easy to verify that the result holds true when
$p=2$
and
$q\ge 2$
since there are only four possible forms of rational functions as described in the proof of Theorem 4.2, out of which only three have zero cross-correlation polynomials.
Assume
$p\ge 3,q\ge 5$
. Using Proposition 4.7, it is enough to show that
$\tau _{{\mathcal {G}}_1}<\tau _{{\mathcal {G}}_2}$
implies
$r_{{\mathcal {G}}_1}(x)<r_{{\mathcal {G}}_2}(x)$
for
$x\in (q-q^{-p+2},q)$
. We in fact prove that
$r_{{\mathcal {G}}_1}(x)<r_{{\mathcal {G}}_2}(x)$
for all
$x\ge 4$
(note that
$q-q^{-p+2}\ge 4$
).
Let
$(u_i,u_i)_x=x^{p-1}+x^{p-1-\tau _{u_i}}+R_{u_i}(x)$
, and
$(w_i,w_i)_x=x^{p-1}+x^{p-1-\tau _{w_i}}+R_{w_i}(x)$
, where
$R_{u_i},R_{w_i}$
are the remainder terms having degrees less than
$p-1-\tau _{u_i}, p-1-\tau _{w_i}$
, respectively, for
$i=1,2$
. Since all the cross-correlation polynomials between the words are zero, we have
$$\begin{align*}r_{{\mathcal{G}}_1}(x)=\dfrac{1}{(u_1,u_1)_x}+\dfrac{1}{(u_2,u_2)_x}\quad \text{and}\quad r_{{\mathcal{G}}_2}(x)=\dfrac{1}{(w_1,w_1)_x}+\dfrac{1}{(w_2,w_2)_x}. \end{align*}$$
Without loss of generality, assume that
$\tau _{u_1}\le \tau _{u_2}$
and
$\tau _{w_1}\le \tau _{w_2}$
, and hence
$\tau _{{\mathcal {G}}_1}=\tau _{u_1}$
and
$\tau _{{\mathcal {G}}_2}=\tau _{w_1}$
. Since
$\tau _{w_1}\le \tau _{w_2}$
, we have
${1}/{(w_1,w_1)_x}\le {1}/{(w_2,w_2)_x}$
. Hence, for
$x\ge 4$
,
$$ \begin{align*} r_{{\mathcal{G}}_2}(x)- r_{{\mathcal{G}}_1}(x)&= \dfrac{1}{(w_1,w_1)_x}+\dfrac{1}{(w_2,w_2)_x}-\dfrac{1}{(u_1,u_1)_x}-\dfrac{1}{(u_2,u_2)_x}\\ &\ge \dfrac{2}{(w_1,w_1)_x}-\dfrac{1}{(u_1,u_1)_x}-\dfrac{1}{(u_2,u_2)_x}. \end{align*} $$
Since
$\tau _{u_1}<\tau _{w_1}$
, we have
$1\le \tau _{u_1}\le p-1$
. Let us consider the following cases.
Case 1:
$1\le \tau _{w_1},\tau _{u_2}\le p-1$
. In this case we have
$(u_1,u_1)_x\ge x^{p-1}+x^{p-1-\tau _{u_1}}$
,
$(u_2,u_2)_x \ge x^{p-1}+x^{p-1-\tau _{u_2}}$
and
$(w_1,w_1)_x\le x^{p-1}+x^{p-1-\tau _{w_1}}+x^{p-1-(\tau _{w_1}+1)}+\cdots +1$
. Hence
$$ \begin{align} r_{{\mathcal{G}}_2}(x)- r_{{\mathcal{G}}_1}(x) &\ge \dfrac{2}{x^{p-1}+x^{p-1-\tau_{w_1}}+x^{p-1-(\tau_{w_1}+1)}+\cdots+1}\nonumber \\[4pt] & - \dfrac{1}{x^{p-1}+x^{p-1-\tau_{u_1}}}-\dfrac{1}{x^{p-1}+x^{p-1-\tau_{u_2}}}>0 \end{align} $$
if and only if its numerator is positive. The numerator is
$$ \begin{align*} &2x^{2(p-1)}(1+x^{-\tau_{u_1}})(1+x^{-\tau_{u_2}})\\[4pt] &\quad -x^{p-1}(x^{p-1}+x^{p-1-\tau_{w_1}}+\cdots+1)(2+x^{-\tau_{u_1}}+x^{-\tau_{u_2}})\\[4pt] &\qquad> x^{2(p-1)}\bigg(2(1+x^{-\tau_{u_1}})(1+x^{-\tau_{u_2}})-\bigg(1+\dfrac{x^{-(\tau_{w_1-1})}}{x-1}\bigg) (2+x^{-\tau_{u_1}}+x^{- \tau_{u_2}})\bigg)\\[4pt] &\qquad\ge x^{2(p-1)}x^{-\tau_{u_1}}\bigg(1+x^{-(\tau_{u_2}-\tau_{u_1})}+2x^{-\tau_{u_2}}-\dfrac{2+x^{-\tau_{u_1}}+x^{-\tau_{u_2}}}{x-1}\bigg), \end{align*} $$
since
$\tau _{u_1}\le \tau _{w_1}-1$
. Thus (4-2) holds true if
$$\begin{align*}(x-1)(1+x^{-(\tau_{u_2}-\tau_{u_1})}+2x^{-\tau_{u_2}})\ge (2+x^{-\tau_{u_1}}+x^{-\tau_{u_2}}), \end{align*}$$
and this is true for all
$x\ge 4$
.
Case 2:
$\tau _{u_2}=p$
. In this case
$(u_2,u_2)_x=x^{p-1}$
. Repeating the same calculations as in Case 1, we obtain
$$ \begin{align*} r_{{\mathcal{G}}_2}(x)- r_{{\mathcal{G}}_1}(x) &\ge \dfrac{2}{x^{p-1}+x^{p-1-\tau_{w_1}}+x^{p-1-(\tau_{w_1}+1)}+\cdots+1} \\[4pt] & - \dfrac{1}{x^{p-1}+x^{p-1-\tau_{u_1}}}-\dfrac{1}{x^{p-1}}>0 \end{align*} $$
if and only if
$$ \begin{align*} & x^{2(p-1)}\bigg(2(1+x^{-\tau_{u_1}})-\bigg(1+\dfrac{x^{-(\tau_{w_1}-1)}}{x-1}\bigg)(2+x^{-\tau_{u_1}})\bigg)\\[4pt] &\quad=x^{2(p-1)}x^{-\tau_{u_1}}\bigg(1-\dfrac{2+x^{-\tau_{u_1}}}{x-1} \bigg)\ge 0, \end{align*} $$
since
$\tau _{u_1}\le \tau _{w_1}-1$
. The last inequality holds true if
$x-1\ge 2+x^{-\tau _{u_1}}$
, and this inequality is satisfied for all
$x\ge 4$
.
Case 3:
$\tau _{w_1}=p$
. In this case we have
$(w_1,w_1)_x=x^{p-1}$
. Note that
$$ \begin{align*} r_{{\mathcal{G}}_2}(x)- r_{{\mathcal{G}}_1}(x) \ge \dfrac{1}{x^{p-1}}\bigg(2 - \dfrac{1}{1+x^{-\tau_{u_1}}}-\dfrac{1}{1+x^{-\tau_{u_2}}}\bigg)>0 \end{align*} $$
if
$x^{-\tau _{u_1}}+x^{-\tau _{u_2}}+2x^{-(\tau _{u_1}+\tau _{u_2})}>0$
, which is true for all
$x>0$
.
Remarks 4.13. (1) Two collections with the same minimal period can give two different escape rates. For instance, consider the following two collections:
${\mathcal {G}}_1=\{u_1=aaaa, u_2=bbbb\}$
and
${\mathcal {G}}_2=\{w_1=aaaa,w_2=bcbc\}$
. Here
$(u_1,w_1)_z=(w_1,u_1)_z=(u_2,w_2)_z= (w_2,u_2)_z=0$
,
$\tau _{{\mathcal {G}}_1}=\tau _{{\mathcal {G}}_2}=1$
, but
$\rho ({\mathcal {G}}_1)\ne \rho ({\mathcal {G}}_2)$
.
(2) Theorem 4.12 fails to hold when a cross-correlation polynomial between the words is nonzero. For instance, for the collections
${\mathcal {G}}_1=\{u_1=abc,u_2=bcd\}$
and
${\mathcal {G}}_2=\{w_1=abc,w_2=ddd\}$
,
$(u_1,w_1)_z\ne 0$
,
$3=\tau _{{\mathcal {G}}_1}=3>\tau _{{\mathcal {G}}_2}=1$
, but
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
.
Remark 4.14 (small values of q not covered in Proposition 4.7 and Theorem 4.8)
In Table 2,
$p=3$
; observe that
$r_{{\mathcal {G}}_i}(x)<r_{{\mathcal {G}}_{i+1}}(x)$
, for all
$x>4$
and hence
$\rho ({\mathcal {G}}_i)<\rho ({\mathcal {G}}_{i+1})$
for all
$q\ge 5$
, from Proposition 4.7.
Consider the collections
${\mathcal {G}}_1$
and
${\mathcal {G}}_{2}$
in Table 2. Observe that
$r_{{\mathcal {G}}_1}(x)<r_{{\mathcal {G}}_2}(x)$
for all
$x> 4-4^{-1}$
and
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
for
$q=4$
. Also, from Proposition 4.7,
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
for all
$q\ge 5$
. Further, consider the collections
${\mathcal {G}}_9$
and
${\mathcal {G}}_{10}$
in Table 2. For some
$x_0\in (3,4-4^{-1})$
,
$r_{{\mathcal {G}}_9}(x_0)=r_{{\mathcal {G}}_{10}}(x_0)$
. Here the relation between
$r_{{\mathcal {G}}_9}(x)$
and
$r_{{\mathcal {G}}_{10}}(x)$
changes as x goes from 3 to 4. In fact,
$\rho ({\mathcal {G}}_{10})<\rho ({\mathcal {G}}_{9})$
for
$q=3$
, but
$\rho ({\mathcal {G}}_{9})<\rho ({\mathcal {G}}_{10})$
for all
$q\ge 4$
.
A similar situation can be observed for the collections
${\mathcal {G}}_5$
and
${\mathcal {G}}_6$
in Table 3. Here
$\rho ({\mathcal {G}}_6)<\rho ({\mathcal {G}}_5)$
for
$q=2$
, but
$\rho ({\mathcal {G}}_5)<\rho ({\mathcal {G}}_6)$
for all
$q\ge 3$
.
Also, in Table 2, observe that the rational functions corresponding to the collections
${\mathcal {G}}_1$
and
${\mathcal {G}}_2$
are different but the escape rates are the same, for
$q=2$
.
Hence, for small values of q, not covered in Proposition 4.7 and Theorem 4.8, nothing can be said about the relationship between the escape rate and the rational function
$r(z)$
.
Similar observations can be made about the relationship between the escape rate and the minimal period of the hole. We give an example where the consequence in Theorem 4.12 does not hold when
$q=2$
. Consider
${\mathcal {G}}_1=\{10111011,01001000\}$
and
${\mathcal {G}}_2=\{11100111,00011000\}$
, which have zero cross-correlations. Here
$\tau _{{\mathcal {G}}_1}=4<5=\tau _{{\mathcal {G}}_2}$
, but
$\rho ({\mathcal {G}}_1)>\rho ({\mathcal {G}}_2)$
at
$q=2$
. However, numerics suggest that Theorem 4.12 holds true for all
$p\ge 3$
and
$q=3,4$
.
5 Full shift with union of more than two cylinders as hole
In this section we extend the results obtained in the previous section to the case of a full shift when the holes are unions of
$t\ge 2$
cylinders (in other words, holes corresponding to
$t\ge 2$
forbidden words). In Section 5.1 we explore the relationship between the escape rate and the corresponding rational function
$r(z)$
, and in Section 5.2 we discuss the relationship between the escape rate and the minimal period of the hole.
5.1 Relationship between the escape rate and the rational function
$r(z)$
We first prove an easy lemma which is used in proving Theorem 5.2.
Lemma 5.1. Let
$f,g$
be two polynomials of degrees
$m,n$
, respectively, with
$m\le n$
. Let
$M,N$
be the maxima in modulus of the coefficients of f and g, respectively. Then the moduli of the coefficients of
$fg$
are bounded above by
$(m+1)MN$
.
Proof. Let
$f(x)=\sum \nolimits _{k=0}^mf_kx^k$
and
$g(x)=\sum \nolimits _{k=0}^ng_kx^k$
with
$m\le n$
. We have that
$M=\max _k \lvert f_k\rvert $
and
$N=\max _k\lvert g_k\rvert $
.
Since
$(fg)(x)=\sum \nolimits _{k=0}^{m+n}(\sum \nolimits _{i+j=k}f_ig_j)x^k$
, we find an upper bound to
$\lvert \sum \nolimits _{i+j=k}f_ig_j\rvert $
. Since
$m\le n$
, k can vary from
$0$
to m and thus there are at most
$m+1$
terms in each sum. Therefore,
$\lvert \sum \nolimits _{i+j=k}f_ig_j\rvert \le (m+1)MN$
, and hence the result follows.
Theorem 5.2. Suppose that
$\mathcal {G}_1$
and
$\mathcal {G}_2$
are finite collections of t words each of length p with symbols from
$\Sigma $
. Then for
$p\ge 3$
, there exists a positive constant
$D(t,p)$
such that for all
$q>D$
, if
$r_{\mathcal {G}_1}(x)<r_{\mathcal {G}_2}(x)$
at
$x=D$
, then
$\rho (\mathcal {G}_1)<\rho (\mathcal {G}_2)$
.
Proof. For a finite collection of t words each of length p, let
$\mathcal {M}(z)$
be the correlation matrix function. Let
$r(z)$
be the sum of the entries of
$\mathcal {M}^{-1}(z)$
. Let
${\mathcal {D}}(z)$
be the determinant of
$\mathcal {M}(z)$
, and
$\mathcal {S}(z)$
be the sum of the entries of the adjoint of
$\mathcal {M}(z)$
. Then
$r(z)=\mathcal {S}(z)/{\mathcal {D}}(z)$
. Also
${\mathcal {D}}(z)$
is a monic polynomial of degree
$t(p-1)$
and
$\mathcal {S}(z)$
is a polynomial of degree
$(t-1)(p-1)$
with the leading coefficient t. Hence, these polynomials can be expressed as
$$\begin{align*}{\mathcal{D}}(z)=z^{t(p-1)}+\sum_{k=0}^{t(p-1)-1}a_kz^k,\quad\mathcal{S}(z)=tz^{(t-1)(p-1)}+\sum_{k=0}^{(t-1)(p-1)-1}b_kz^k. \end{align*}$$
If
$a=\max _k\{\lvert a_k\rvert \}$
and
$b=\max _k\{\lvert b_k\rvert ,t\}$
, then the proofs of Lemmas 4.3 and 4.4 can be imitated for obtaining the existence and position of the largest real root, say
$\lambda $
, of
$(z-q){\mathcal {D}}(z)+\mathcal {S}(z)$
.
First assume that
$q>a+b+1$
. Then on
$\lvert z\rvert =a+b+1$
,
$$ \begin{align*} \dfrac{\lvert z-q\rvert \lvert {\mathcal{D}}(z)\rvert }{\lvert \mathcal{S}(z)\rvert }\ge \dfrac{\lvert {\mathcal{D}}(z)\rvert }{\lvert \mathcal{S}(z)\rvert }>\lvert z\rvert ^{p-2}\dfrac{\lvert z\rvert -1-a}{b}= (a+b+1)^{p-2}>1, \end{align*} $$
for
$p\ge 3$
. Hence, as in Lemma 4.3, by Rouché’s theorem,
$\lambda $
is the only zero of
$(z-q){\mathcal {D}}(z)+\mathcal {S}(z)$
on
$\lvert z\rvert>a+b+1$
. Since
$\lvert {\mathcal {D}}(z)\rvert>0$
,
$\lambda $
is the Perron root of the associated adjacency matrix.
Next, we prove that
$q-1<\lambda <q$
. Since
$$\begin{align*}\mathcal{S}(q)\ge tq^{(t-1)(p-1)}-\dfrac{bq^{(t-1)(p-1)-1}}{q-1}> q^{(t-1)(p-1)}\dfrac{t(q-1)-b}{q-1}>0, \end{align*}$$
because
$q>{b}/{t}+1$
, we obtain
$(q-x){\mathcal {D}}(x)-\mathcal {S}(x)<0$
at
$x=q$
.
Now, at
$x=q-1$
,
$$ \begin{align*} (q-x){\mathcal{D}}(x)-\mathcal{S}(x)\ge \dfrac{(q-1)^{(t-1)(p-1)+1}}{q-2}((q-2-a)(q-1)^{p-2}-b)>0, \end{align*} $$
since
$b\ge 2$
,
$p\ge 3$
, and
$q>a+b+1$
imply
$$\begin{align*}(q-2-a)(q-1)^{p-2}-b>(b-1)(q-1)-b>(b-1)b-b\ge 0. \end{align*}$$
We now imitate the arguments in the proofs of Proposition 4.7 and Theorem 4.8. By Lemma 5.1, the absolute values of the coefficients of
${\mathcal {D}}_2\mathcal {S}_1-{\mathcal {D}}_1\mathcal {S}_2$
are bounded above by
$(a_1b_2+a_2b_1)((t-1)(p-1)+1)$
, where for
$i=1,2$
,
$a_i,b_i$
are the largest coefficients in modulus for
${\mathcal {D}}_i,\mathcal {S}_i$
, respectively, as defined above. Thus, by Lagrange’s bound on roots of a polynomial, all the zeros of
$r_{{\mathcal {G}}_1}-r_{{\mathcal {G}}_2}$
lie in the disc of radius
$(a_1b_2+a_2b_1)((t-1)(p-1)+1)+1$
. If we assume
$D=D(t,p)=(a_1b_2+a_2b_1)tp+1$
, then
$r_{{\mathcal {G}}_1}(D)<r_{{\mathcal {G}}_2}(D)$
implies
$r_{{\mathcal {G}}_1}(x)<r_{{\mathcal {G}}_2}(x)$
, for all
$x\ge D$
. Hence, for all
$q>D$
,
$\rho ({\mathcal {G}}_1)<\rho ({\mathcal {G}}_2)$
, the proof of which is similar to that of Proposition 4.7.
5.1.1 Upper bounds on a and b in terms of p and t
Let
${\mathcal {G}}=\{w_1,w_2,\ldots ,w_t\}$
be a collection of words of length p. The correlation matrix function is given by
${\mathcal {M}}(z)=[(w_j,w_i)_z]_{i,j}$
, where
$(w_i,w_i)_z$
has degree
$p-1$
and
$(w_i,w_j)_z$
has degree at most
$p-2$
, for
$i\ne j$
. The polynomial
${\mathcal {D}}(z)$
, which is the determinant of
${\mathcal {M}}(z)$
, can be written as
$$\begin{align*}{\mathcal{D}}(z)=\sum_{\pi\in S_t}\mathrm{sgn}(\pi)\bigg(\prod_{i=1}^t(w_{\pi i},w_i)_z\bigg), \end{align*}$$
where
$S_t$
is the symmetric group on t symbols. Choose
$\pi \in S_t$
. If
$\pi $
fixes j entries, then
$\prod _{i=1}^t(w_{\pi i},w_i)_z$
is the product of t polynomials, where j of them have degree
$p-1$
, and the rest have degree at most
$p-2$
. Also since each of these polynomials has coefficient either 0 or 1, the coefficients of
$\prod _{i=1}^t(w_{\pi i},w_i)_z$
are bounded above by
$(p-1)^{t-1}$
when
$j=0$
, and
$p^{\,j-1}(p-1)^{t-j}$
otherwise (this is obtained by using inductive arguments in Lemma 5.1). Let
$k_t(j)$
denote the number of permutations in
$S_t$
that fix exactly j many symbols. Hence
$$ \begin{align} a\le k_t(0)(p-1)^{t-1}+\sum_{j=1}^t k_t(j)p^{j-1}(p-1)^{t-j}\le p^{t-1}\sum_{j=0}^t k_t(j)=p^{t-1}t!. \end{align} $$
For the purpose of finding an upper bound for b, we can assume that all the submatrices of
$\mathcal {M}(z)$
of order
$t-1$
are matrix functions where the diagonal entries have degree at most
$p-1$
and the off-diagonal entries have degree at most
$p-2$
. Thus each entry of the adjoint matrix of
${\mathcal {M}}(z)$
is bounded above by
$p^{t-2}(t-1)!$
, using (5-1). Hence
$$ \begin{align} b\le t^2p^{t-2}(t-1)!= t(t!)p^{t-2}. \end{align} $$
Combining (5-1) and (5-2), we get
$ab\le t(t!)^2p^{2t-3}$
. Hence,
$D(t,p)$
can be chosen as
$2t^2(t!)^2p^{2t-2}+1$
. Using this method, for
$t=2$
, we obtain
$D(2,p)=32p^2+1$
, which is a much worse lower bound on q than that obtained in Theorem 4.8.
Remark 5.3. Theorem 5.2 may not hold true for small values of q and p. One of the crucial steps in the proof is that the Perron root
$\lambda $
is at least
$q-1$
. This is violated in the following example. Consider
$q=3$
,
${\mathcal {G}}=\{02,10,11,21,22\}$
(
$p=2$
): the Perron root is
$\lambda =1.466$
.
5.2 Relationship between the escape rate and minimal period of the hole
In this subsection we extend Theorem 4.12 to the case when the hole corresponds to a union of
$t\ge 2$
cylinders based at words of length
$p\ge 2$
. We obtain a lower bound on q in terms of t.
Theorem 5.4. Suppose that
$t\ge 2$
and
$q\ge 2$
satisfy
$$ \begin{align} (q-1)(t+1)-t q\bigg(1+\dfrac{1}{q}\bigg)^{t-1}\ge 0. \end{align} $$
Let
${\mathcal {G}}_1=\{u_1,u_2,\ldots ,u_t\}$
and
${\mathcal {G}}_2=\{w_1,w_2,\ldots ,w_t\}$
be such that
$u_i,w_i$
are words of equal length
$p\ge 2$
. Let
$(u_i,u_j)_z=(w_i,w_j)_z=0$
for all
$1\le i\neq j\le t$
. If
$\tau _{{\mathcal {G}}_1}<\tau _{{\mathcal {G}}_2}$
, then
$r_{{\mathcal {G}}_1}(q)<r_{{\mathcal {G}}_2}(q)$
. Inequality (5-3) holds true for
$q\ge t 2^{t-1}+1$
.
Proof. Assume that
$1\le \tau _{w_i},\tau _{u_i}<p$
,
$i=1,2,\ldots ,t$
. Let
$(u_i,u_i)_q=q^{p-1}+q^{p-1-\tau _{u_i}}+R_{u_i}(q),(w_i,w_i)_q=q^{p-1}+q^{p-1-\tau _{w_i}}+R_{w_i}(q)$
, where
$R_{u_i},R_{w_i}$
are the reminder terms with degrees less than
$p-1-\tau _{u_i},p-1-\tau _{w_i}$
, respectively, for
$i=1,\ldots ,t$
. Since all the cross-correlation polynomials between the words are zero, we have
$$\begin{align*}r_{{\mathcal{G}}_1}(q)=\dfrac{1}{(u_1,u_1)_q}+\dfrac{1}{(u_2,u_2)_q}+\cdots+\dfrac{1}{(u_t,u_t)_q}, \end{align*}$$
$$\begin{align*}r_{{\mathcal{G}}_2}(q)=\dfrac{1}{(w_1,w_1)_q}+\dfrac{1}{(w_2,w_2)_q}+\cdots+\dfrac{1}{(w_t,w_t)_q}. \end{align*}$$
Without loss of generality, we assume that
$\tau _{u_1}\le \tau _{u_2}\le \cdots \le \tau _{u_t}$
and
$\tau _{w_1}\le \tau _{w_2}\le \cdots \le \tau _{w_t}$
. Furthermore,
$\tau _{{\mathcal {G}}_1}<\tau _{{\mathcal {G}}_2}$
implies
$\tau _{u_1}<\tau _{w_1}$
. We consider the following three cases.
Firstly, when
$\tau _{w_1},\tau _{u_1},\ldots ,\tau _{u_t}<p$
,
$$ \begin{align*} r_{{\mathcal{G}}_2}(q)-r_{{\mathcal{G}}_1}(q)&= \sum_{i=1}^t\dfrac{1}{(w_i,w_i)_q}- \sum_{i=1}^t\dfrac{1}{(u_i,u_i)_q}\\ &\ge \dfrac{t}{(w_1,w_1)_q}- \sum_{i=1}^t\dfrac{1}{q^{p-1}+q^{p-1-\tau_{u_i}}}\\ &\ge \dfrac{t}{q^{p-1}+\sum_{j=0}^{p-1-\tau_{w_1}}q^j}- \sum_{i=1}^t\dfrac{1}{q^{p-1}+q^{p-1-\tau_{u_i}}}. \end{align*} $$
The last term in the above inequality is positive if and only if
$$ \begin{align} t \prod_{j=1}^t (1+q^{-\tau_{u_j}})> \bigg(1+\dfrac{q^{-\tau_{u_1}}}{q-1}\bigg)\bigg(\sum_{i=1}^t\bigg( \prod_{j\ne i} (1+q^{-\tau_{u_j}}) \bigg)\bigg), \end{align} $$
since
$\tau _{u_1}\le \tau _{w_1}-1$
. For
$1\le j\le t$
, let
$$\begin{align*}\beta_j=\sum_{\substack{1\le i_1\le \cdots\le i_j\le t}}q^{-\tau_{u_{i_1}}}\cdots q^{-\tau_{u_{i_j}}}. \end{align*}$$
Then
$$\begin{align*}\prod_{j=1}^t (1+q^{-\tau_{u_j}})=1+\beta_1+\cdots+\beta_t \end{align*}$$
and
$$\begin{align*}\sum_{i=1}^t\bigg( \prod_{j\ne i} (1+ q^{-\tau_{u_j}}) \bigg)=t+(t-1)\beta_1+(t-2)\beta_2+\cdots+\beta_{t-1}. \end{align*}$$
Hence, inequality (5-4) holds true if
$$ \begin{align*} & t(q-1) (1+\beta_1+\beta_2+\cdots+\beta_t) \\[3pt] &\quad - (q-1+q^{-\tau_{u_1}}) (t+(t-1)\beta_1+(t-2)\beta_2+\cdots+\beta_{t-1}) \\[3pt] &\qquad =(q-1)(\beta_1+2\beta_2+\cdots+t\beta_{t})-q^{-\tau_{u_1}}(t+ (t-1)\beta_1+\cdots+\beta_{t-1})> 0. \end{align*} $$
Since
$1\le \tau _{u_1}\le \tau _{u_2}\le \cdots \le \tau _{u_t}$
, we obtain
$$ \begin{align*} \beta_1&<\beta_1q^{\tau_{u_1}}=1+q^{-(\tau_{u_2}-\tau_{u_1})}+\cdots+q^{-(\tau_{u_t}-\tau_{u_1})}\le t, \\[3pt] \beta_2&<\beta_2q^{\tau_{u_1}} = q^{-\tau_{u_2}}+\cdots+q^{-\tau_{u_t}}+q^{-(\tau_{u_2}+\tau_{u_3}-\tau_{u_1})}+\cdots +q^{-(\tau_{u_{t-1}}+\tau_{u_t}-\tau_{u_1})} \le {t\choose 2}\dfrac{1}{q},\\ &\vdots\\ \beta_k&<\beta_kq^{\tau_{u_1}}\le {t\choose k} \dfrac{1}{q^{k-1}}. \end{align*} $$
Since
$\beta _1q^{\tau _{u_1}}>1,$
we have
$(q-1)q^{\tau _{u_1}}(\beta _1+2\beta _2+\cdots +t\beta _{t})>q-1$
. Hence
$$ \begin{align*} &(q-1)q^{\tau_{u_1}}(\beta_1+2\beta_2+\cdots+t\beta_{t})-(t+ (t-1)\beta_1+\cdots+\beta_{t-1})\\[3pt] &\quad>q-1-\bigg(t+\sum_{k=1}^{t-1}(t-k)\dfrac{1}{q^{k-1}}{t\choose k}\bigg). \end{align*} $$
Now consider the term
$$ \begin{align*} \sum_{k=1}^{t-1}(t-k)\dfrac{1}{q^{k-1}}{t\choose k}=tq\sum_{k=1}^{t-1}{t-1\choose k}\dfrac{1}{q^{k}} =tq\bigg(\bigg(1+\dfrac{1}{q}\bigg)^{t-1}-1\bigg). \end{align*} $$
Hence, inequality (5-4) holds if (5-3) is satisfied. Also, inequality (5-3) holds for
$q\ge t 2^{t-1}+1$
, since
${1}/{q^{k-1}}\le 1$
, for any
$1\le k\le t-1$
.
Secondly, when
$\tau _{w_1}=p$
,
$$ \begin{align*} r_{{\mathcal{G}}_2}(q)-r_{{\mathcal{G}}_1}(q)&= \sum_{i=1}^t\dfrac{1}{(w_i,w_i)_q}- \sum_{i=1}^t\dfrac{1}{(u_i,u_i)_q}\\ &\ge \dfrac{t}{(w_1,w_1)_q}- \sum_{i=1}^t\dfrac{1}{q^{p-1}+q^{p-1-\tau_{u_i}}}\\ &\ge \dfrac{t}{q^{p-1}}- \sum_{i=1}^t\dfrac{1}{q^{p-1}+q^{p-1-\tau_{u_i}}}>0. \end{align*} $$
Finally, we consider the case where
$1\le \tau _{u_1},\tau _{u_2},\ldots ,\tau _{u_\ell }<p$
, and
$\tau _{u_{\ell +1}}=\cdots = \tau _{u_t}=p$
, for some
$1\le \ell \le t$
. With the same calculations as before, the result holds if
$$\begin{align*}q-1-\bigg(t+\sum_{k=1}^{\ell-1}(t-k)\dfrac{1}{q^{k-1}}{t\choose k}\bigg)>q-1-\bigg(t+\sum_{k=1}^{t-1}(t-k)\dfrac{1}{q^{k-1}}{t\choose k}\bigg)\ge 0.\\[-3.8pc] \end{align*}$$
6 Escape rate on a subshift of finite type
In this section we extend the results presented in the earlier sections for an irreducible subshift of finite type
$\Sigma _{\mathcal {F}}$
. We first consider the case when
${\mathcal {F}}=\{w\}$
, and compare escape rates into two holes in
$\Sigma _{\mathcal {F}}$
which correspond to the collections of forbidden words
${\mathcal {G}}_1=\{w_1\}$
and
${\mathcal {G}}_2=\{w_2\}$
, with
$\vert w\vert =\vert w_1\vert =\vert w_2\vert =p$
. It follows from Theorems 4.2 and 4.8 that there exists a positive constant D, such that for
$p=2$
,
$q\ge 2$
, if
$r_{{\mathcal {F}}\cup {\mathcal {G}}_1}(2)<r_{{\mathcal {F}}\cup {\mathcal {G}}_2}(2)$
, and for
$p\ge 3, q>3p^2+2$
, if
$r_{{\mathcal {F}}\cup {\mathcal {G}}_1}(3p^2+2)<r_{{\mathcal {F}}\cup {\mathcal {G}}_2}(3p^2+2)$
, then
$\rho ({\mathcal {F}}\cup {\mathcal {G}}_1)<\rho ({\mathcal {F}}\cup {\mathcal {G}}_2)$
. Hence
$$ \begin{align*} \rho({\mathcal{G}}_1;\Sigma_{\mathcal{F}})&= h_{\mathrm{top}}(\Sigma_{\mathcal{F}}) - h_{\mathrm{top}}(\Sigma_{{\mathcal{F}}\cup {\mathcal{G}}_1})=\rho({\mathcal{F}}\cup{\mathcal{G}}_1)-\rho({\mathcal{F}})\\[4pt] &<\rho({\mathcal{F}}\cup{\mathcal{G}}_2)-\rho({\mathcal{F}})= \rho({\mathcal{G}}_2;\Sigma_{\mathcal{F}}). \end{align*} $$
This can be seen using Tables 4, and 5. Interestingly, holes with same measure can have different escape rates and holes with different measures can have the same escape rate. For example, in Table 4,
$q=3$
,
${\mathcal {F}}=\{00\}$
,
${\mathcal {G}}_1=\{w_1=11\}$
,
${\mathcal {G}}_2=\{w_2=01\}$
, and
${\mathcal {G}}_3=\{w_3=12\}$
. Here
$\mu (C_{w_1})=\mu (C_{w_3})$
, but
$\rho ({\mathcal {G}}_1;\Sigma _{\mathcal {F}})\ne \rho ({\mathcal {G}}_3;\Sigma _{\mathcal {F}})$
. Moreover,
$\mu (C_{w_1})\ne \mu (C_{w_2})$
but
$\rho ({\mathcal {G}}_1;\Sigma _{\mathcal {F}})=\rho ({\mathcal {G}}_2;\Sigma _{\mathcal {F}})$
. Recall that
$\mu $
denotes the Parry measure on
$\Sigma _{\mathcal {F}}$
.
Table 4 Escape rate values for
$p=2$
and
$q=3,4,\ldots ,10$
for a subshift of finite type
$\Sigma _{\mathcal {F}}$
. Here
$r_{{\mathcal {F}}\cup {\mathcal {G}}_i}(z)<r_{{\mathcal {F}}\cup {\mathcal {G}}_{i+1}}(z)$
for all real
$z>2$
.
Table 5 Escape rate values for
$p=3$
and
$q=3,4,\ldots ,10$
for a subshift of finite type
$\Sigma _{\mathcal {F}}$
. Here
$r_{{\mathcal {F}}\cup {\mathcal {G}}_i}(z)<r_{{\mathcal {F}}\cup {\mathcal {G}}_{i+1}}(z)$
for all real
$z>2$
.
The next result is a straightforward consequence of the preceding discussion.
Theorem 6.1. Let
${\mathcal {F}}=\{w=a_1a_2\cdots a_p\}$
and
$\mathcal {G}$
be the collection of all words u of length p such that
$(w,u)_z=(u,w)_z=0$
. Let
$a,b\in \Sigma $
be distinct symbols in
$\Sigma \setminus \{a_1,a_p\}$
. Let
${\mathcal {G}}_u=\{u\}$
, for all
$u\in \mathcal {G}$
. Then
$$\begin{align*}\min_{u\in\mathcal{G}}(\rho({\mathcal{G}}_u;\Sigma_{\mathcal{F}}))=\rho({\mathcal{G}}_{u_0};\Sigma_{\mathcal{F}})\quad \text{and}\quad \max_{u\in\mathcal{G}}(\rho({\mathcal{G}}_u;\Sigma_{\mathcal{F}}))=\rho({\mathcal{G}}_{u_1};\Sigma_{\mathcal{F}}), \end{align*}$$
where
$u_0=\bar {a}$
, and
$u_1=a\bar {b}$
.
Proof. Let
$r(z)$
be the rational function corresponding to the collection
$\{w,u\}$
, where
$u\in \mathcal {G}$
. Since
$(w,u)_z=(u,w)_z=0$
, we get
$r(z)= {1}/{(w,w)_z} + {1}/{(u,u)_z}$
. Note that
$r(z)$
is minimum when
$(u,u)_z=z^{p-1}+z^{p-2}+\cdots +1$
, and maximum when
$(u,u)_z=z^{p-1}$
. Since
$a,b\notin \{a_1,a_p\}$
,
$u_0,u_1\in \mathcal {G}$
, we have
$(u_0,u_0)_z=z^{p-1}+z^{p-2}+\cdots +1$
and
$(u_1,u_1)_z=z^{p-1}$
.
Remark 6.2. Since the escape rate is invariant under conjugacy, all the results stated in this paper can be applied to maps that are conjugate to a subshift of finite type with a hole corresponding to a union of cylinders.
The next result extends Theorem 5.2 when the underlying space is an irreducible subshift of finite type
$\Sigma _{\mathcal {F}}$
, for some collection
${\mathcal {F}}$
consisting of words of identical length with symbols from
$\Sigma $
.
Theorem 6.3. Consider an irreducible subshift
$\Sigma _{\mathcal {F}}$
. Suppose
${\mathcal {G}}_1$
and
${\mathcal {G}}_2$
are finite collections consisting of t allowed words in
$\Sigma _{\mathcal {F}}$
each of length
$p\ge 2$
. Then for any
$p\ge 3$
, there exists a positive constant
$D=D(t,p)$
such that for all
$q> D$
, if
$r_{{\mathcal {F}}\cup {\mathcal {G}}_1}(x)<r_{{\mathcal {F}}\cup {\mathcal {G}}_2}(x)$
for
$x=D$
, then
$\rho ({\mathcal {G}}_1;\Sigma _{\mathcal {F}})<\rho ({\mathcal {G}}_2;\Sigma _{\mathcal {F}})$
.
Remark 6.4. Under the hypothesis of Theorem 5.4, using Theorems 5.4 and 6.3, for the collection of forbidden words
${\mathcal {F}}\cup {\mathcal {G}}_i$
,
$i=1,2$
, for
$p\ge 3$
and for
$q>D$
satisfying inequality (5-3), we obtain
$\rho ({\mathcal {G}}_1;\Sigma _{\mathcal {F}})<\rho ({\mathcal {G}}_2;\Sigma _{\mathcal {F}})$
.
7 Concluding remarks and future directions
Remark 4.14 highlights various situations for small values of p and q which are not covered in Theorems 4.8 and 4.12. However, numerical calculations suggest that the bound
$q>3p^2+2$
is not the best. One of the reasons for this is that our proofs consider only the fact that the correlation polynomials have a certain degree and have coefficients 0 or 1. These polynomials have more structure to them. For example, if we consider two different words of the same length of the types
$aa\cdots a$
and
$bb\cdots b$
, then their autocorrelation polynomials have all their coefficients 1 but all their cross-correlations must be
$0$
. In fact, the upper bound that we obtain for the coefficients of the rational function r is never achieved by any collection of words. This issue will be taken up in our future work.
This study leads to several other interesting problems. As illustrated in Remark 2.8, if the underlying subshift is induced with a general Markov measure which is not the Parry measure, then for two holes with the same correlation function, the escape rate may not be the same. This raises the issue of the relationship between the escape rate and the topological entropy, in general. The question of how the escape rate changes with q can also be explored. The numerics presented in the tables suggest that the escape rate decreases with increasing q, which is expected since the size of the hole reduces. If this is true in general, we would like to know at what rate the escape rate decays. The numerics presented in the tables also suggest that Theorem 4.8 holds true for all values of
$p\geq 2$
and
$q\geq 2$
. Our proof is not helpful in this regard. Another interesting question is the dependence of the escape rate on the Poincaré recurrence time when the cross-correlation between the forbidden words is nonzero. It is certain from Remark 4.13 that it does not depend on the minimal period of the hole. A question of general interest is to explore other factors that influence the escape rate into the hole other than the length, the number of corresponding forbidden words, and the minimum period of the hole. In [Reference Bolding and Bunimovich2], Bolding and Bunimovich discuss finite-time dynamical properties of the shift map on a full shift with cylinders as holes. For each
$n\ge 1$
, they compare the values of
$f_w(n)$
, the number of words of length n which end with w but do not contain w as subwords in any other place. This issue can be studied in our setup – subshifts of finite type with holes.
Acknowledgement
The authors would like to thank the referees for their helpful comments and suggestions.
