Topological entropy of maps on regular curves

In [G.T. Seidler, The topological entropy of homeomorphisms on one-dimensional continua, Proc. Amer. Math. Soc. 108 (1990) 1025-1030], G.T. Seidler proved that the topological entropy of every homeomorphism on a regular curve is zero. Also, in [H. Kato, Topological entropy of monotone maps and confluent maps on regular curves, Topology Proc. 28 (2) (2004) 587-593] the topological entropy of confluent maps on regular curves was investigated. In particular, it was proved that the topological entropy of every monotone map on any regular curve is zero. In this paper, furthermore we investigate the topological entropy of more general maps on regular curves. We evaluate the topological entropy of maps f on regular curves X in terms of the growth of the number of components of f−n(y) (y∈X).     

Topological entropy of maps on the real line

The aim of this paper is to introduce a definition of topological entropy for continuous maps such that, at least for continuous real maps, it keeps the following general philosophy: positive topological entropy implies that the map has a complicated dynamical behaviour. Besides, we pursue that our definition keeps some properties which are hold by the classic definition of topological entropy introduced for compact sets.     

Bowen entropy for actions of amenable groups

Bowen introduced a definition of topological entropy of subset inspired by Hausdorff dimension in 1973 [1]. In this paper we consider the Bowen entropy for amenable group action dynamical systems and show that, under the tempered condition, the Bowen entropy of the whole compact space for a given Følner sequence equals the topological entropy. For the proof of this result, we establish a variational principle related to the Bowen entropy and the Brin–Katok local entropy formula for dynamical systems with amenable group actions.     

Development of concept of topological entropy for systems with multiple time

We study the topological entropy for dynamical systems with discrete or continuous multiple time. Due to the generalization of a well-known one time-dimensional result we show that the definition of topological entropy, using the approach for subshifts, leads to the zero entropy for many systems different from subshift. We define a new type of relative topological entropy to avoid this phenomenon. The generalization of Bowen’s power rule allows us to define topological and relative topological entropies for systems with continuous multiple time. As an application, we find a relation between the relative topological entropy and controllability of linear systems with continuous multiple time.     

Algebraic interpretation of continued fractions

An alternative (equivalent) definition of continued fractions in terms of a group representation is introduced. With this definition, continued fractions are considered as sequences in a topological group, converging (in some sense) to its boundary. This point of view yields an alternative (equivalent) proof for Lane's convergence theorem for periodic continued fractions.     

Entropy points and applications

First notions of entropy point and uniform entropy point are introduced using Bowen's definition of topological entropy. Some basic properties of the notions are discussed. As an application it is shown that for any topological dynamical system there is a countable closed subset whose Bowen entropy is equal to the entropy of the original system.

Then notions of C-entropy point are introduced along the line of entropy tuple both in topological and measure-theoretical settings. It is shown that each C-entropy point is an entropy point, and the set of C-entropy points is the union of sets of C-entropy points for all invariant measures.

     

Relative Entropy, Asymptotic Pairs and Chaos

In this paper, we prove that positive conditional entropy impliesthe existence of asymptotic pairs and scrambled sets on fibers.Moreover, we introduce the notion of conditional topologicalentropy for a subset using Bowen's definition of separated andspanning sets, and prove that the conditional topological entropyof a system relative to a factor is the supremum of conditionaltopological entropy of its scrambled sets on fibers.     

Topological entropy of continuous functions on topological spaces

Adler, Konheim and McAndrew introduced the concept of topological entropy of a continuous mapping for compact dynamical systems. Bowen generalized the concept to non-compact metric spaces, but Walters indicated that Bowen’s entropy is metric-dependent. We propose a new definition of topological entropy for continuous mappings on arbitrary topological spaces (compactness, metrizability, even axioms of separation not necessarily required), investigate fundamental properties of the new entropy, and compare the new entropy with the existing ones. The defined entropy generates that of Adler, Konheim and McAndrew and is metric-independent for metrizable spaces. Yet, it holds various basic properties of Adler, Konheim and McAndrew’s entropy, e.g., the entropy of a subsystem is bounded by that of the original system, topologically conjugated systems have a same entropy, the entropy of the induced hyperspace system is larger than or equal to that of the original system, and in particular this new entropy coincides with Adler, Konheim and McAndrew’s entropy for compact systems.     

Volume growth and entropy

An inequality is proved, bounding the growth rates of the volumes of iterates of smooth submanifolds in terms of the topological entropy. ForC ^x-smooth mappings this inequality implies the entropy conjecture, and, together with the opposite inequality, obtained by S. Newhouse, proves the coincidence of the growth rate of volumes and the topological entropy, as well as the upper semicontinuity of the entropy.     

Topological entropy of formal languages

We introduce the notion of topological entropy of a formal language as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this notion in terms of approximations of the Myhill–Nerode congruence relation, we are able to compute the topological entropies of certain example languages. Those examples suggest that the notion of a “simple” formal language coincides with the language having zero entropy.     

Entropy Computation on the Unit Disc of a Meromorphic Map

We propose a new definition of entropy based on both topological and metric entropy for the meromorphic maps. The entropy is then computed on the unit disc of a meromorphic map, which is called the extended Blaschke function, and is a nonlinear extension of the normalized Lorentz transformation. We nd that the de ned entropy is computable and observe several interested results, such as maximal entropy, entropy overshoot due to topological transition, entropy reduction to zero, and scaling invariance in conjunction with parameter space.     

On the mean square of the remainder for the euclidean lattice point counting problem

We study an invariant of dynamical systems called naive entropy, which is defined for both measurable and topological actions of any countable group. We focus on nonamenable groups, in which case the invariant is two-valued, with every system having naive entropy either zero or infinity. Bowen has conjectured that when the acting group is sofic, zero naive entropy implies sofic entropy at most zero for both types of systems. We prove the topological version of this conjecture by showing that for every action of a sofic group by homeomorphisms of a compact metric space, zero naive entropy implies sofic entropy at most zero. This result and the simple definition of naive entropy allow us to show that the generic action of a free group on the Cantor set has sofic entropy at most zero. We observe that a distal Γ-system has zero naive entropy in both senses, if Γ has an element of infinite order. We also show that the naive entropy of a topological system is greater than or equal to the naive measure entropy of the same system with respect to any invariant measure.     

Independence in topological and <Emphasis Type="Italic">C</Emphasis>*-dynamics

We develop a systematic approach to the study of independence in topological dynamics with an emphasis on combinatorial methods. One of our principal aims is to combinatorialize the local analysis of topological entropy and related mixing properties. We also reframe our theory of dynamical independence in terms of tensor products and thereby expand its scope to C*-dynamics.     

Omega-limit sets and invariant chaos in dimension one

Omega-limit sets play an important role in one-dimensional dynamics. During last fifty year at least three definitions of basic set has appeared. Authors often use results with different definition. Here we fill in the gap of missing proof of equivalency of these definitions. Using results on basic sets we generalize results in paper [P. Oprocha, Invariant scrambled sets and distributional chaos, Dyn. Syst. 24 (2009), no. 1, 31–43.] to the case continuous maps of finite graphs. The Li-Yorke chaos is weaker than positive topological entropy. The equivalency arises when we add condition of invariance to Li-Yorke scrambled set. In this note we show that for a continuous graph map properties positive topological entropy; horseshoe; invariant Li-Yorke scrambled set; uniform invariant distributional chaotic scrambled set and distributionaly chaotic pair are mutually equivalent.     

Continuity of Entropy for Bimodal Maps

We characterize the continuity of the topological entropy ofbimodal maps of the interval and of the circle in terms of thebehaviour of the iterates of the turning points and of the valueof the topological entropy of the map under consideration. Inthe case of bimodal circle maps of degree one we also studythe continuity of the entropy in terms of their rotation intervals.     

A note on distributional chaos with respect to a sequence

The aim of this note is to use methods developed by Kuratowski and Mycielski to prove that some more common notions in topological dynamics imply distributional chaos with respect to a sequence. In particular, we show that the notion of distributional chaos with respect to a sequence is only slightly stronger than the definition of chaos due to Li and Yorke. Namely, positive topological entropy and weak mixing both imply distributional chaos with respect to a sequence, which is not the case for distributional chaos as introduced by Schweizer and Smítal.     

线段映射的局部变差增长与局部拓扑熵

本文考虑闭区间上变差有界的连续映射f:I→I的局部变差增长γ(x,f)与局部拓扑熵h(x,f)．将证明γ(x,f)≥h(x,f)对所有x∈I成立,并且局部变差增长映射γf(x)=γ(x,f)与局部拓扑熵映射sf(x)=h(x,f)都是上半连续的,得到一个变分原理:局部变差增长γ(x,f)与局部拓扑熵h(x,f)的上确界分别等于全局变差增长γ(f)=limn→∞1/nln Var(fn)与拓扑熵h(f)．当映射f:I→I拓扑传递时,与Brin 和Katok对局部(测度)熵的讨论类似,我们证明,至多除一个不动点外,局部变差增长γ(x,f)与局部拓扑熵h(x,f)在开区间I°内恒为常值．     

Algebraic entropy and the action of mapping class groups on character varieties

We extend the definition of algebraic entropy to endomorphisms of affine varieties. We then calculate the algebraic entropy of the action of elements of mapping class groups on various character varieties, and show that it is equal to a quantity we call the spectral radius, a generalization of the dilatation of a pseudo-Anosov mapping class. Our calculations are compatible with all known calculations of the topological entropy of this action.     

Topological Entropy of a Class of Subshifts of Finite Type

In this paper, we construct a special class of subshifts of finite type. By studying the spectral radius of the transfer matrix associated with the subshift of finite type, we obtain an estimation of its topological entropy. Interestingly, we find that the topological entropy of this class of subshifts of finite type converges monotonically to log(n + 1) (a constant only depends on the structure of the transfer matrices) as the increasing of the order of the transfer matrices.