Related papers: Rigidity and Flexibility of Polynomial Entropy

The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…

We prove two continuity theorems for the Lyapunov exponents of the maximal entropy measure of polynomial automorphisms of $\mathbb{C}^2$. The first continuity result holds for any family of polynomial automorphisms of constant dynamical…

In this note a notion of generalized topological entropy for arbitrary subsets of the space of all sequences in a compact topological space is introduced. It is shown that for a continuous map on a compact space the generalized topological…

Bowen showed that a continuous expansive map with specification has a unique measure of maximal entropy. We show that the conclusion remains true under weaker non-uniform versions of these hypotheses. To this end, we introduce the notions…

We investigate the properties of chain recurrent, chain transitive, and chain mixing maps (generalizations of the well-known notions of non-wandering, topologically transitive, and topologically mixing maps). We describe the structure of…

It is well known that the presence of horseshoes leads to positive entropy. If our goal is to construct a continuous map with infinite entropy, we can consider an infinite sequence of horseshoes, ensuring an unbounded number of legs.…

In this paper, we consider a one-parameter family of degree $d\ge 2$ rational maps with an automorphism group containing the cyclic group of order $d$. We construct a polynomial whose roots correspond to parameter values for which the…

Isomorph theory is one of the promising theories to understand the quasi-universal relationship between thermodynamic, dynamic and structural characteristics. Based on the hidden scale invariance of the inverse power law potentials, it…

Let $f$ be a $C^r$ ($r>1$) diffeomorphism on a compact surface $M$ with $h_{\rm top}(f)\geq\frac{\lambda^{+}(f)}{r}$ where $\lambda^{+}(f):=\lim_{n\to+\infty}\frac{1}{n}\max_{x\in M}\log \left\|Df^{n}_{x}\right\|$. We establish an…

We study the ergodic theory of a one-parameter family of interval maps T_alpha arising from generalized continued fraction algorithms. First of all, we prove the dependence of the metric entropy of T_alpha to be Hoelder-continuous in the…

Shannon entropy, a cornerstone of information theory, statistical physics and inference methods, is uniquely identified by the Shannon-Khinchin or Shore-Johnson axioms. Generalizations of Shannon entropy, motivated by the study of…

The statistical properties of mostly expanding partially hyperbolic diffeomorphisms have been substantially studied. In this paper, we would like to address the entropy properties of mostly expanding partially hyperbolic diffeomorphisms. We…

This paper demonstrates a duality between the non-robustness of polynomial time dimension and the existence of one-way functions. Polynomial-time dimension (denoted $\mathrm{cdim}_\mathrm{P}$) quantifies the density of information of…

In this paper, we study dynamics of maps on quasi-graphs characterizing their invariant measures. In particular, we prove that every invariant measure of quasi-graph map with zero topological entropy has discrete spectrum. Additionally, we…

We show that $\mathcal{C}^{\infty}$ local diffeomorphisms of closed surfaces whose topological entropy is larger than the logarithm of their degree admit a finite number of ergodic measures of maximal entropy. To do this, we construct…

As defined by W. Thurston, the core entropy of a polynomial is the entropy of the restriction to its Hubbard tree. For each d >= 2, we study the core entropy as a function on the parameter space of polynomials of degree d, and prove it…

The aim of the paper is to study the link between non additivity of some entropies and their boundedness. We propose an axiomatic construction of the entropy relying on the fact that entropy belongs to a group isomorphic to the usual…

In this paper, we investigate the asymptotic stability of finite-dimensional stochastic integrable Hamiltonian systems via information entropy. Specifically, we establish the asymptotic vanishing of Shannon entropy difference (with…

For several computational problems in homotopy theory, we obtain algorithms with running time polynomial in the input size. In particular, for every fixed k>1, there is a polynomial-time algorithm that, for a 1-connected topological space X…

An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…