Complexity function and entropy of induced maps on hyperspaces of continua

summary

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…

In short

The paper computes polynomial entropy for induced dynamics on hyperspaces of continua using a complexity function derived from an invariant subset of a two-sided shift space. It establishes criteria for infinite topological entropy and provides complete descriptions of polynomial entropy for homeomorphisms on graphs, linking it to the maximal number of edges with common branch points possessing wandering points.

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 used across episodes

This episode discusses

The paper

Complexity function and entropy of induced maps on hyperspaces of continua · Read on arXiv

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

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

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.

DOI: 10.1007/s00605-026-02257-4

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.

More episodes

← Home