Supremum subsequence entropy for IP-sets
Consider a topological dynamical system \((X, T)\) and an increasing sequence of natural numbers \(E = \{e_1< e_2< e_3, \dotsc\}\). For a given finite open cover \(\mathcal{U}\) of \(X\), the topological sequence entropy along \(E\) with respect to \(\mathcal{U}\) is defined as:\N\[\Nh^E(T, \mathcal{U}) = \limsup_{n \to \infty} \frac{1}{n} \log N\left( \bigvee_{j=1}^{n} T^{-e_j}\mathcal{U} \right).\N\]\NHere, \(N(\mathcal{V})\) denotes the smallest number of sets needed to form a subcover of the cover \(\mathcal{V}\), and the join \(\mathcal{U} \vee \mathcal{V}\) is the common refinement of covers \(\mathcal{U}\) and \(\mathcal{V}\). The topological \(E\)-sequence entropy of \((X, T)\) is defined by\N\[\Nh^E(T) = \sup_{\mathcal{U}} h^E(T, \mathcal{U}),\N\]\Nwhere the supremum is taken over all finite open covers of \(X\). The supremum \(A\)-subsequence entropy of \((X, T)\) is defined as\N\[\Nh^{*}_A(T) = \sup_{E \subset A} h^E(T),\N\]\Nwhere the supremum is taken over all increasing subsequences of \(A\). When \(A = \mathbb{N}\), \textit{W. Huang} and \textit{X. Ye} [Adv. Math. 220, 1689--1716 (2009; Zbl 1201.37013)] proved that \(h^{*}_A(T)\) takes values in \(\{0, \log 2, \log 3, \dotsc\} \cup \{\infty\}\). In this paper, the authors define \(h^{*}_A(T) = \sup_{E \subset A} h^E(T)\). The authors give some conditions on \(A\) under which this assertion still holds. The authors introduce the \(A\)-submaximal pattern entropy \(h^{\text{pat}}_A (T, \mathcal{U})\) for a given increasing sequence \(A\). Let \((X, T)\) be a t.d.s. and \(A \subset \mathbb{N}\) be an increasing sequence. The authors proved that if for any finite open cover \(\mathcal{U}\) of \(X\) there exists an increasing subsequence \(E\) of \(A\) such that \(h^E(T, \mathcal{U}) = h^{\text{pat}}_A (T, \mathcal{U})\), then\N\[\Nh^{*}_A(T) \in \{0, \log 2, \log 3, \dotsc\} \cup \{\infty\}.\N\]\NThe authors also proved that if \(A\) is an IP-set, then\N\[\Nh^{*}_A(T) \in \{0, \log 2, \log 3, \dotsc\} \cup \{\infty\}.\N\]
- A disjointness theorem involving topological entropy
- Combinatorial lemmas and applications to dynamics
- scientific article; zbMATH DE number 3719449 (Why is no real title available?)
- IP-systems in ergodic theory
- ON METRIC INVARIANTS OF ENTROPY TYPE
- Sequence entropy and the maximal pattern complexity of infinite words
- Topological Sequence Entropy
This page was built for publication: Supremum subsequence entropy for IP-sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995717)
