Complexity function and entropy of induced maps on hyperspaces of continua

arXiv:2603.10644 · math.DS · Submitted 2026-03-11 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "Complexity function and entropy of induced maps on hyperspaces of continua".

Paper summary: Ada: To recap, this paper investigates the complexity function of an invariant subset of a two-sided shift space to compute the polynomial entropy for induced dynamics on hyperspaces of continua and they offer a criterion for when the complexity function implies that C(f) has infinite topological entropy.

Emmy: It seems they're setting up this machinery by first establishing how continuous maps on a compact metric space X induce a map on the hyperspace of all non-empty closed subsets, and then asking what the actual relationship is between the original dynamics on X and that induced dynamics.

Kolya: So, are they just looking at general continuous maps, or are they focusing on specific types of systems where this complexity function approach actually works well? What's the scope here?

Ada: They focus specifically on one-dimensional dynamical systems, and then in a later part, they give a complete description for the polynomial entropy of C(f) when f is a homeomorphism of a graph.

Emmy: That seems like they're moving from general concepts to tackling a very concrete case—graphs—where they manage to pin down the polynomial entropy using this complexity function.

Kolya: So, for someone just listening, what does this mean? It means if you have a system on a graph with certain properties related to branch points and wandering points, you can calculate its polynomial entropy directly.

Ada: Exactly. They show that for a star X which is like a tree structure with a branch point of order k, if every edge has at least one wandering point, then the polynomial entropy of the induced map on the set of connected subsets is exactly equal to k.

Conclusion: Emmy: Looking at this whole paper, "Complexity function and entropy of induced maps on hyperspaces of continua," it seems like they've successfully linked an abstract complexity tool directly to a concrete entropy calculation for certain graph dynamics.

Ada: They managed to provide that complete description for the polynomial entropy of C(f) when f is a homeomorphism of a graph, which is summarized in Corollary four and then further refined in Corollary thirteen.

Kolya: So what's the practical implication here for someone studying these kinds of one-dimensional systems? What do we actually get from this result?

Ada: The main implication is that for a graph, the polynomial entropy depends entirely on the maximum number of edges that share a common branch point and each has a wandering point.

Emmy: That's quite specific. It gives you a clear structural feature to look for in the graph itself—that maximal number k is what dictates the polynomial entropy value.

Kolya: So, we can use this structural information about the graph to determine its dynamical complexity without having to run some complicated calculations on the full map.

Ada: That's right. They also showed that if you have a homeomorphism of a graph, it's not just about that maximal number k. It depends on whether there are closed paths and if those paths are conjugate to simple circle rotations.

Emmy: So they’re not just giving one number; they’re giving a condition for when the polynomial entropy is two, and when it's zero.

Kolya: That's a lot of detail packed into that conclusion about hpol(C(f)). It shows how subtle these entropy calculations can be based on the topology of the underlying graph.

Ada: It confirms that for these induced maps on continua, the polynomial entropy is determined by those specific topological constraints related to branching and wandering points in a very direct way.

JELENA KATIC, DARKO MILINKOVI Ɯ C, MILAN PERI Ɯ C

Ministry of Science, Technological Development and Innovation, Republic of Serbia

math.DS

Submitted: 2026-03-11

Updated: 2026-03-11

Comments: 19 pages, 1 figure

DOI: 10.1007/s00605-026-02257-4

License: http://creativecommons.org/licenses/by/4.0/

The gist: The paper uses the complexity function of an invariant subset of a two-sided shift space to compute polynomial entropy for induced dynamics on hyperspaces of continua…

Key concepts

Complexity Function
This function is defined as pΣ(m) = |L m(Σ)|, where L m(Σ) is defined in equation (4). It serves as a tool to compute topological entropy by taking the limit of log pΣ(m)/m. It measures the complexity related to invariant subsets of shift spaces.
Induced Dynamics
When a continuous map f acts on a space X, it naturally induces a map 2f on the hyperspace 2X, which consists of all non-empty closed subsets of X. This concept explores how the dynamics change when moving from individual points to collections of points.
Polynomial Entropy
This is a measure of complexity defined as hpol(f; Y) = lim ε→0 lim sup n→∞ log sep(n, ε; Y)/log n. It quantifies the exponential growth rate of separated sets within a space Y under the map f, offering a more refined measure than standard topological entropy.

Terminology

Summary

The paper uses the complexity function of an invariant subset of a two-sided shift space to compute polynomial entropy for induced dynamics on hyperspaces of continua, providing a criterion for infinite topological entropy <ref:2603. p. 0

Where the paper says it

We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain onedimensional dynamical systems. We also provide a simple criterion for f that implies C(f) has infinite topological entropy.

10644#pg6>.

Relationship between individual and collective dynamics

Every continuous map on a compact metric space X induces a continuous map f called the induced map on the hyperspace 2X of all nonempty closed subsets of X <ref:2603.10644#pg3>. A natural question arises: what are the possible relations between the given (individual) dynamics on X and the induced (collective) dynamics on the hyperspace <ref:2603. p. 0

Where the paper says it

If X is connected, we consider the hyperspace C(X) consisting of all nonempty closed and connected subsets of X, and the induced map C(f) = 2f |C(X) . A natural question arises: what are the possible relations between the given (individual) dynamics on X and the induced (collective) dynamics on the hyperspace.

10644#pg2> Despite progress over the past few decades, this relationship remains mostly unexplored and continues to draw considerable attention <ref:2603. p. 0
Where the paper says it

A natural question arises: what are the possible relations between the given (individual) dynamics on X and the induced (collective) dynamics on the hyperspace. Despite progress over the past few decades, this relationship remains mostly unexplored and continues to draw considerable attention.

10644#pg2>. For instance, it is known that certain dynamical properties of the system (X, f) are preserved in the induced system (2X, 2f), such as Li-Yorke chaos (see [12]) and positive topological entropy (see [16]) <ref:2603. p. 0
Where the paper says it

Despite progress over the past few decades, this relationship remains mostly unexplored and continues to draw considerable attention. For instance, it is known that certain dynamical properties of the system (X, f) are preserved in the induced system (2X, 2 f ), such as Li-Yorke chaos (see [12]) and positive topological entropy (see [16]).

10644#pg2>. On the other hand, some properties of (2X, 2f) also imply the same properties for (X, f) - for example, transitivity (see [21]) <ref:2603. p. 0
Where the paper says it

For instance, it is known that certain dynamical properties of the system (X, f) are preserved in the induced system (2X, 2 f ), such as Li-Yorke chaos (see [12]) and positive topological entropy (see [16]). On the other hand, some properties of (2X, 2 f ) also imply the same properties for (X, f) - for example, transitivity (see [21]).

10644#pg2>.

Topological and Polynomial Entropy Measures

The topological entropy h(f) is a classical measure of the complexity of a dynamical system (X, f), quantifying the average exponential growth in the number of distinguishable orbit segments <ref:2603.10644#pg2>. The topological entropy of the induced map has been studied by Bauer and Sigmund [7], Kwietniak and Oprocha [14], Lampart and Raith [16], Hernandez and Mendez [11], Arbieto and Bohorquez [1] among others <ref:2603. p. 0

Where the paper says it

It is clear that the topological entropy of the induced system on a hyperspace is greater than or equal to that of f, since the latter is a factor of the former; see Subsection 2. The topological entropy of the induced map has been studied by Bauer and Sigmund [7], Kwietniak and Oprocha [14], Lampart and Raith [16], Hern´andez and M´endez [11], Arbieto and Bohorquez [1], among others.

10644#pg3>. The topological entropy of the induced system on a hyperspace is greater than or equal to that of f, since the latter is a factor of the former <ref:2603. p. 0
Where the paper says it

The topological entropy h(f) is a classical measure of the complexity of a dynamical system (X, f), quantifying the average exponential growth in the number of distinguishable orbit segments. It is clear that the topological entropy of the induced system on a hyperspace is greater than or equal to that of f, since the latter is a factor of the former; see Subsection 2.

10644#pg2>. Regarding the topological entropy of C(f), there are examples where h(f) > 0 and C(f) is both finite and infinite, see [14] and [16] <ref:2603. p. 0
Where the paper says it

It is known that if f has positive topological entropy, then 2f has infinite topological entropy [5]. Regarding the topological entropy of C(f), there are examples where h(f) > 0 and C(f) is both finite and infinite, see [14] and [16].

10644#pg3>.

Entropy for One-Dimensional Spaces

The authors investigate the polynomial entropy of C(f) on certain one-dimensional spaces <ref:2603.10644#pg3>. Theorem 3 states that for a star X = Sk with a branch point of order k and f: X → X a homeomorphism, if every edge possesses a wandering point, then hpol(C(f)) = k <ref:2603. p. 1

Where the paper says it

Let X = Sk be a star with a branch point of order k and f : X → X a homeomorphism. If every edge possesses a wandering point, then hpol(C(f)) = k.

10644#pg4>. Corollary 4 provides a complete description of hpol(C(f)) for a homeomorphism f of a graph <ref:2603. p. 2
Where the paper says it

3 The proofs of Theorem 1 and Theorem 3 rely on expressing the topological and polynomial entropy in terms the complexity function of certain subsets of the twosided shift space (see Subsetion 2. The following corollary of Theorem 3 provides a complete description of hpol(C(f)) for a homeomorphism f of a graph.

10644#pg4>.

Entropy on Manifolds and General Results

Theorem 14 states that if f: M → M is a reversible dynamical system on a connected compact topological manifold M with the dimension at least two, and if f possesses a wandering point, then h(C(f)) = ∞ <ref:2603.10644#pg6>. The proof shows that for such systems, h(2f; Fω) ≥ 2k <ref:2603. p. 0

Where the paper says it

The authors are partially supported by the Ministry of Science, Technological Development and Innovation, Republic of Serbia, through the project 451-03-33/2026-03/200104. 1 arXiv:2603.

10644#pg6>. Theorem 9 provides a general result relating the complexity function to the topological and polynomial entropy for a sigma-invariant set Σ <ref:2603. p. 2
Where the paper says it

3 The proofs of Theorem 1 and Theorem 3 rely on expressing the topological and polynomial entropy in terms the complexity function of certain subsets of the twosided shift space (see Subsetion 2. The following corollary of Theorem 3 provides a complete description of hpol(C(f)) for a homeomorphism f of a graph.

10644#pg6>.

Complexity Function Computation

The paper defines the complexity function by pΣ(m):= L m(Σ), where L m(Σ) is defined as in (4) <ref:2603.10644#pg8>. The complexity function can be used to compute the topological entropy by h(σΣ) = lim m→∞ log pΣ(m)/m <ref:2603. p. 6

Where the paper says it

It is known that one can compute the topological entropy by using the complexity function. Namely, if Σ ⊂ AZ is a subshift it holds: h(σ|Σ) = lim m→∞ log pΣ(m) m (see [13]).

10644#pg8>. The polynomial entropy is defined as hpol(f; Y) = limε→0 lim sup n→∞ log sep(n, ε; Y)/log n <ref:2603. p. 4
Where the paper says it

We have: sep(f1, n, ε/L; Y1) ≥ sep(f2, n, ε; Y2), so h(f1; Y1) ≥ h(f2; Y2) □ When the topological entropy of the system is equal to zero, one useful tool for measuring compelxity is polynomial entropy. It is defined as hpol(f; Y ) = limε→0 lim sup n→∞ log sep(n, ε; Y ) log n , i.

10644#pg8>. Theorem 9 states that hpol(σ; Σ) = lim sup n→∞ log pΣ(m)/log m <ref:2603. p. 6
Where the paper says it

] Let Σ be a subshift. Then hpol(σ|Σ) = lim sup n→∞ log pΣ(m) log m .

10644#pg8>.

Conclusion on Complexity Bounds

The authors conclude by showing that for a homeomorphism f of a graph, the polynomial entropy is bounded by k, leading to Corollary 13 <ref:2603.10644#pg6>. The final result shows that hpol(C(f)) = max[l, 2] if l ≥ 1 and hpol(C(f)) = 0 if l = 0 <ref:2603. p. 5

Where the paper says it

We will also use the following property of polynomial entropy: if f : X → X, g : Y → Y are two continuous map, and f × g : X × Y → X × Y, (f × g)(x, y) := (f(x), g(y)), then hpol(f × g) = hpol(f) + hpol(g), so for f ×k : X×k → X×k it holds: hpol(f ×k ) = khpol(f). If Y = Sm j=1 Yj where Yj are f-invariant, then (2) hpol(f; Y ) = max{hpol(f; Yj ) | j = 1, .

10644#pg6>. The paper also confirms the existence of systems where the entropy inequalities hold for topological and polynomial entropy <ref:2603. p. 1
Where the paper says it

Certain properties such as the power formula, the σ-union property, and the variational principle hold for topological entropy but do not necessarily hold for polynomial entropy (see [18, 19]). The following consequence of Bowen’s formula (see Theorem 17 in [7]) also holds for topological entropy but not for polynomial entropy: if π : X → Y is continuous semicongugacy between dynamical systems (X, f) and (Y, g) and is also uniformly finite-to-one (that is, there exists M > 0 such that |π −1 (y)| ≤ M for all y ∈ Y ), then h(f) = h(g).

p. 1
Where the paper says it

Certain properties such as the power formula, the σ-union property, and the variational principle hold for topological entropy but do not necessarily hold for polynomial entropy (see [18, 19]). The following consequence of Bowen’s formula (see Theorem 17 in [7]) also holds for topological entropy but not for polynomial entropy: if π : X → Y is continuous semicongugacy between dynamical systems (X, f) and (Y, g) and is also uniformly finite-to-one (that is, there exists M > 0 such that |π −1 (y)| ≤ M for all y ∈ Y ), then h(f) = h(g).

p. 1
Where the paper says it

Certain properties such as the power formula, the σ-union property, and the variational principle hold for topological entropy but do not necessarily hold for polynomial entropy (see [18, 19]). The following consequence of Bowen’s formula (see Theorem 17 in [7]) also holds for topological entropy but not for polynomial entropy: if π : X → Y is continuous semicongugacy between dynamical systems (X, f) and (Y, g) and is also uniformly finite-to-one (that is, there exists M > 0 such that |π −1 (y)| ≤ M for all y ∈ Y ), then h(f) = h(g).

10644#pg6>.

Example of Entropy Inequality

The authors provide an affirmative answer to a question posed in [1] by constructing a dynamical system such that h(C(f)). They claim that for X = [0, 1] and f: X → X a homeomorphism with a wandering point, hpol(C(f)) = 1 while hpol(Cn(f)) = 2n <ref:2603. p. 1

Where the paper says it

Let X = Sk be a star with a branch point of order k and f : X → X a homeomorphism. If every edge possesses a wandering point, then hpol(C(f)) = k.

10644#pg6>. The paper also shows that hpol(C2(f)) = 4 for the example of f: [0, 1] → [0, 1] with a wandering point <ref:2603. p. 1
Where the paper says it

However, somewhat unexpectedly, the existence of a wandering point in a dynamical system on a manifold of dimension greater than 1 implies that h(C(f)) = ∞. This is the first result of the paper.

10644#pg6>.

Topological Entropy on Manifolds

Theorem 16 states that for Y ⊂ X such that f(Y) = Y, we have h∗(f; Y) = h(f; Y) and h∗pol(f; Y) = hpol(f; Y) <ref:2603.10644#pg6>. This result is established by relating the covering numbers to the spanning sets <ref:2603. p. 0

Where the paper says it

The authors are partially supported by the Ministry of Science, Technological Development and Innovation, Republic of Serbia, through the project 451-03-33/2026-03/200104. 1 arXiv:2603.

10644#pg6>. The proof relies on the inequalities (15), (16), and (17) <ref:2603. p. 0
Where the paper says it

The authors are partially supported by the Ministry of Science, Technological Development and Innovation, Republic of Serbia, through the project 451-03-33/2026-03/200104. 1 arXiv:2603.

10644#pg6>.

Final Summary of Results

Corollary 4 provides a complete description of hpol(C(f)) for a homeomorphism f of a graph, stating that hpol(C(f)) = k if k ≥ 2, hpol(C(f)) = 2 if k ≤ 1 and there exists a closed path C <ref:2603.10644#pg6>, and hpol(C(f)) = 0 otherwise <ref:2603. p. 2

Where the paper says it

Let k be the maximal number of edges with a common branch point that possess a wandering point. Then • hpol(C(f)) = k if k ≥ 2; • hpol(C(f)) = 2 if k ≤ 1 and there exists a closed path C ⊂ X such that f n|C is not conjugate to the circle rotation, for all n; • hpol(C(f)) = 0 otherwise.

p. 2
Where the paper says it

Let k be the maximal number of edges with a common branch point that possess a wandering point. Then • hpol(C(f)) = k if k ≥ 2; • hpol(C(f)) = 2 if k ≤ 1 and there exists a closed path C ⊂ X such that f n|C is not conjugate to the circle rotation, for all n; • hpol(C(f)) = 0 otherwise.

p. 2
Where the paper says it

Let k be the maximal number of edges with a common branch point that possess a wandering point. Then • hpol(C(f)) = k if k ≥ 2; • hpol(C(f)) = 2 if k ≤ 1 and there exists a closed path C ⊂ X such that f n|C is not conjugate to the circle rotation, for all n; • hpol(C(f)) = 0 otherwise.

p. 2
Where the paper says it

Let k be the maximal number of edges with a common branch point that possess a wandering point. Then • hpol(C(f)) = k if k ≥ 2; • hpol(C(f)) = 2 if k ≤ 1 and there exists a closed path C ⊂ X such that f n|C is not conjugate to the circle rotation, for all n; • hpol(C(f)) = 0 otherwise.

p. 2
Where the paper says it

Let k be the maximal number of edges with a common branch point that possess a wandering point. Then • hpol(C(f)) = k if k ≥ 2; • hpol(C(f)) = 2 if k ≤ 1 and there exists a closed path C ⊂ X such that f n|C is not conjugate to the circle rotation, for all n; • hpol(C(f)) = 0 otherwise.

10644#pg6>. This is summarized in Corollary 13 <ref:2603. p. 0
Where the paper says it

The authors are partially supported by the Ministry of Science, Technological Development and Innovation, Republic of Serbia, through the project 451-03-33/2026-03/200104. 1 arXiv:2603.

p. 0
Where the paper says it

The authors are partially supported by the Ministry of Science, Technological Development and Innovation, Republic of Serbia, through the project 451-03-33/2026-03/200104. 1 arXiv:2603.

p. 0
Where the paper says it

The authors are partially supported by the Ministry of Science, Technological Development and Innovation, Republic of Serbia, through the project 451-03-33/2026-03/200104. 1 arXiv:2603.

10644#pg6>. The paper concludes that for a graph, the polynomial entropy is determined by the maximal number of edges with a common branch point that possess a wandering point <ref:2603. p. 2
Where the paper says it

Let X be a graph and f : X → X a homeomorphism. Let k be the maximal number of edges with a common branch point that possess a wandering point.

p. 2
Where the paper says it

Let X be a graph and f : X → X a homeomorphism. Let k be the maximal number of edges with a common branch point that possess a wandering point.

10644#pg6>.

Summary of Key Findings

Theorem 10 establishes hpol(C(f)) = k if X = Sk and every edge possesses a wandering point <ref:2603.10644#pg6>. Corollary 12 further refines this by stating hpol(C(f)) = max[l, 2] if l ≥ 1 and hpol(C(f)) = 0 if l = 0 <ref:2603. p. 2

Where the paper says it

3 The proofs of Theorem 1 and Theorem 3 rely on expressing the topological and polynomial entropy in terms the complexity function of certain subsets of the twosided shift space (see Subsetion 2. The following corollary of Theorem 3 provides a complete description of hpol(C(f)) for a homeomorphism f of a graph.

10644#pg6>. The paper successfully computes the entropy of C(f) for specific graph structures <ref:2603. p. 1
Where the paper says it

In [15], Labrousse proved that polynomial entropy is an invariant that distinguishes between these two circle homeomorphisms. Topological and polynomial entropy share some basic properties: they are both conjugacy invariants, depend only on the topology (not on the specific choice of metric inducing it), satisfy the finite union property, and obey a product formula.

10644#pg6>.

Theorem 14 establishes that if f: M → M is a reversible dynamical system on a connected compact topological manifold M with dimension at least two and possesses a wandering point, then h(C(f)) = ∞ <ref:2603.10644#pg6>. This result is derived by relating the entropy of the induced map to the shift map on sequences <ref:2603. p. 5

Where the paper says it

However, for the shift map, there is a particularly convenient method to do so. For a finite set A (called an alphabet), denote by AZ the set of all two-sided sequences x = {xn}∞ n=−∞ where xn ∈ A.

10644#pg6>. The calculation shows that h(C(f)) ≥ 2k <ref:2603. p. 0
Where the paper says it

The authors are partially supported by the Ministry of Science, Technological Development and Innovation, Republic of Serbia, through the project 451-03-33/2026-03/200104. 1 arXiv:2603.

10644#pg6>.

Polynomial Entropy on Graphs

Corollary 13 provides a complete description of hpol(C(f)) for a homeomorphism f of a graph, depending on the maximal number k of edges with a common branch point that possess a wandering point <ref:2603.10644#pg6>. This is summarized in Corollary 4 <ref:2603. p. 0

Where the paper says it

The authors are partially supported by the Ministry of Science, Technological Development and Innovation, Republic of Serbia, through the project 451-03-33/2026-03/200104. 1 arXiv:2603.

10644#pg6>. The paper demonstrates that hpol(C(f)) = k if k ≥ 2, hpol(C(f)) = 2 if k ≤ 1 and there exists a closed path C <ref:2603. p. 2
Where the paper says it

Let k be the maximal number of edges with a common branch point that possess a wandering point. Then • hpol(C(f)) = k if k ≥ 2; • hpol(C(f)) = 2 if k ≤ 1 and there exists a closed path C ⊂ X such that f n|C is not conjugate to the circle rotation, for all n; • hpol(C(f)) = 0 otherwise.

p. 2
Where the paper says it

Let k be the maximal number of edges with a common branch point that possess a wandering point. Then • hpol(C(f)) = k if k ≥ 2; • hpol(C(f)) = 2 if k ≤ 1 and there exists a closed path C ⊂ X such that f n|C is not conjugate to the circle rotation, for all n; • hpol(C(f)) = 0 otherwise.

p. 2
Where the paper says it

Let k be the maximal number of edges with a common branch point that possess a wandering point. Then • hpol(C(f)) = k if k ≥ 2; • hpol(C(f)) = 2 if k ≤ 1 and there exists a closed path C ⊂ X such that f n|C is not conjugate to the circle rotation, for all n; • hpol(C(f)) = 0 otherwise.

10644#pg6>, and hpol(C(f)) = 0 otherwise <ref:2603.10644#pg6>.

Final Conclusion on Polynomial Entropy

The paper concludes that for a graph, the polynomial entropy is determined by the maximal number of edges with a common branch point that possess a wandering point <ref:2603.10644#pg6>. This is summarized in Corollary 13 <ref:2603.10644#pg6>. The paper demonstrates that hpol(C(f)) = k if k ≥ 2, hpol(C(f)) = 2 if k ≤ 1 and there exists a closed path C <ref:2603.10644#pg6>, and hpol(C(f)) = 0 otherwise <ref:2603.10644#pg6>. The paper also confirms the existence of systems where the entropy inequalities hold for topological and polynomial entropy <ref:2603.10644#pg6>.

Corollary 13 provides a complete description of hpol(C(f)) for a homeomorphism f of a graph, stating that hpol(C(f)) = k if k ≥ 2, hpol(C(f)) = 2 if k ≤ 1 and there exists a closed path C <ref:2603.10644#pg6>, and hpol(C(f)) = 0 otherwise <ref:2603.10644#pg6>. The paper concludes that for a graph, the polynomial entropy is determined by the maximal number of edges with a common branch point that possess a wandering point <ref:2603.10644#pg6>. This is summarized in Corollary 13 <ref:2603.10644#pg6>. The paper demonstrates that hpol(C(f)) = k if k ≥ 2, hpol(C(f)) = 2 if k ≤ 1 and there exists a closed path C <ref:2603.10644#pg6>, and hpol(C(f)) = 0 otherwise <ref:2603.10644#pg6>. The paper also confirms the existence of systems where the entropy inequalities hold for topological and polynomial entropy <ref:2603.10644#pg6>.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Better analysis of dynamical systems on hyperspaces allows AI to compute polynomial entropy for induced dynamics on graphs by identifying wandering points and using the criterion that every edge possesses a wandering point.

  2. The system can distinguish between circle homeomorphisms with zero topological entropy and those with periodic and wandering points by computing the polynomial entropy, as Labrousse proved polynomial entropy is an invariant that distinguishes between these two circle homeomorphisms.

  3. AI systems can determine the complexity function of induced maps on graphs by using a criterion for f that implies C(f) has infinite topological entropy, which helps in calculating hpol(C(f)) for specific star spaces.

  4. For dynamical systems on manifolds of dimension greater than or equal to two, the AI can predict infinite topological entropy if the system possesses a wandering point, as stated in Theorem 14.

  5. The AI can calculate hpol(C(f)) for a graph by identifying k, defined as the maximal number of edges with a common branch point that possess a wandering point, using Corollary 13.

Abstract

We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems. We also provide a simple criterion for f that implies C(f) has infinite topological entropy.

Sources

Related papers