相关论文: Polynomial entropy of induced homeomorphisms on $C…

We compute the polynomial entropy of the induced maps on hyperspace for a homeomorphism $f$ of an interval or a circle with finitely many non-wandering points.

We prove that the polynomial entropy of an orientation preserving homeomorphism of the circle equals 1 when the homeomorphism is not conjugate to a rotation and that it is 0 otherwise. In a second part we prove that the polynomial entropy…

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 show that the polynomial entropy of homeomorphisms on regular curves is bounded above by one. Moreover, the polynomial entropy equals one under the fairly mild condition that the homeomorphism possesses a wandering point. We obtain a…

We prove that the polynomial entropy of the induced map $F_n(f)$ on the $n$-fold symmetric product of a compact space $X$ and its suspension are both equal to $nh_{pol}(f)$, when $f:X\to X$ is a homeomorphism with a finite chain recurrent…

We study the polynomial entropy of the wandering part of any invertible dynamical system on a compact metric space. As an application we compute the polynomial entropy of Brouwer homeomorphisms (fixed point free orientation preserving…

In this paper we study the polynomial entropy of homeomorphism on compact metric space. We construct a homeomorphism on a compact metric space with vanishing polynomial entropy that it is not equicontinuous. Also we give examples with…

In this paper we discuss two different existing algorithms for computing topological entropy and we perform one of them in order to compute the isentropes for cubic polynomials.

We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…

Let $f : M \rightarrow M$ be a Morse-Smale diffeomorphism defined on a compact and connected manifold without boundary. Let $C(M)$ denote the hyperspace of all subcontinua of M endowed with the Hausdorff metric and $C(f) : C(M) \rightarrow…

We consider entanglement through permeable interfaces in the c=1 (1+1)-dimensional conformal field theory. We compute the partition functions with the interfaces inserted. By the replica trick, the entanglement entropy is obtained…

A classical problem in dynamical systems is to measure the complexity of a map in terms of their orbits. One of the main tools we have to achieve this goal is entropy. However, many interesting families of dynamical systems have every…

Let $f:X\to X$ be a self homeomorphism of a continuum $X$, we show that the topological entropy of the induced system $(2^X,2^f)$ is infinite provided that $X\setminus \Omega(f)$ is not empty. If furthermore $X$ is a regular curve then it…

We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…

For $p\geq 2$, the $p$-adic ring $C^*$-algebra $\mathcal{Q}_p$ is the universal $C^*$-algebra generated by a unitary $U$ and an isometry $S_p$ such that $S_pU=U^pS_p$ and $\sum_{l=0}^{p-1}U^lS_pS_p^*U^{-l}=1$. For any $k$ coprime with $p$…

We introduce the notion of a one-way horseshoe and show that the polynomial entropy of an interval map is given by one-way horseshoes of iterates of the map, obtaining in such a way an analogue of Misiurewicz's theorem on topological…

The aim of this paper is to calculate entropy in the sense of Dimitrov-Haiden-Katzarkov-Kontsevich and polynomial entropy as defined by Fan-Fu-Ouchi of derived autoequivalences of derived discrete algebras over an algebraically closed…

Given a large real symmetric, positive semidefinite m-by-m matrix, the goal of this paper is to show how a numerical approximation of the entropy, given by the sum of the entropies of the individual eigenvalues, can be computed in an…

In this note a new method for computing the entanglement entropy of a CFT holographically is explored. It consists of finding a bulk background with a boundary metric that has the conical singularities needed to compute the entanglement…

We calculate the statistical entropy of a scalar field on the background of three-dimensional De Sitter space in terms of the brick wall method and finally derive the perimeter law of the entropy.