✦ LIBER ✦

Computing the topological entropy of shifts

✍ Scribed by Christoph Spandl

Publisher: John Wiley and Sons
Year: 2007
Tongue: English
Weight: 251 KB
Volume: 53
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.200710014

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Different characterizations of classes of shift dynamical systems via labeled digraphs, languages, and sets of forbidden words are investigated. The corresponding naming systems are analyzed according to reducibility and particularly with regard to the computability of the topological entropy relative to the presented naming systems. It turns out that all examined natural representations separate into two equivalence classes and that the topological entropy is not computable in general with respect to the defined natural representations. However, if a specific labeled digraph representation – namely primitive, right‐resolving labeled digraphs – of some class of shifts is considered, namely the shifts having the specification property, then the topological entropy gets computable. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

📜 SIMILAR VOLUMES

Entropy Numbers of Weighted Shifts

✍ A.A.W. Mehanna 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 83 KB

The main object of this paper is to establish a lower bound of the entropy numbers for powers of weighted shift operators on p spaces, 1 ≤ p ≤ ∞, and we obtain some results of Pietsch. Furthermore, we get an interesting inequality between entropy numbers and s numbers of these shifts and, as a simpl

Computing the Topological Degree with No

Computing the Topological Degree with Noisy Information

✍ Misako Yokoyama 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 143 KB

On the Complexity of Isolating Real Root

On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree

✍ B. Mourrain; M.N. Vrahatis; J.C. Yakoubsohn 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 217 KB

On Turing degrees of points in computabl

On Turing degrees of points in computable topology

✍ Iraj Kalantari; Larry Welch 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

## Abstract This paper continues our study of computable point‐free topological spaces and the metamathematical points in them. For us, a __point__ is the intersection of a sequence of basic open sets with compact and nested closures. We call such a sequence a __sharp filter__. A function __f~F~__

Managing the Topological Expansion of Co

Managing the Topological Expansion of Computer Networks in an Optimal Way

✍ Debashis Saha; Amitava Mukherjee 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 453 KB 👁 2 views

This article describes a subgradient-based near-optimal heuristic algorithm designed for minimizing the search of links that need to be added to an existing telecommunications network to enhance the survivability and routability of the network.

Empirical computation of 13C NMR chemica

Empirical computation of 13C NMR chemical shifts

✍ Carlos Jaime 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 353 KB

## Abstract An equation correlating ^13^C NMR chemical shifts and the global van der Waals energy of the carbon atoms (rms deviation δ ≤ 2.6 ppm) in aliphatic hydrocarbons, alcohols and chlorinated derivatives was derived. Molecular mechanics calculations have been used to determine the global van