相关论文: A survey on the topological entropy of cubic polyn…

We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.

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…

A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore,…

The chaotical dynamics is studied in different Friedmann-Robertson- Walker cosmological models with scalar (inflaton) field and hydrodynamical matter. The topological entropy is calculated for some particular cases. Suggested scheme can be…

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 give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…

We present an analytical-numerical method providing robust upper estimates for the topological entropy or, more generally, uniform volume growth exponents of differentiable mappings. By introducing varying metrics, we simplify the analysis…

Topological entropy or spatial entropy is a way to measure the complexity of shift spaces. This study investigates the relationships between the spatial entropy and the various periodic entropies which are computed by skew-coordinated…

We compute the polynomial entropy of $C(f)$ where $f$ is any circle homeomorphism.

The notion of entropy appears in many fields and this paper is a survey about entropies in several branches of Mathematics. We are mainly concerned with the topological and the algebraic entropy in the context of continuous endomorphisms of…

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…

Topological entropy is a measure of complex dynamics. In this regard, multimodal maps play an important role when it comes to study low-dimensional chaotic dynamics or explain some features of higher dimensional complex dynamics with…

This article is a survey on the topic of polynomial amoebas. We review results of papers written on the topic with an emphasis on its computational aspects. Polynomial amoebas have numerous applications in various domains of mathematics and…

This is an outline of work in progress. We study the conjecture that the topological entropy of a real cubic map depends ``monotonely'' on its parameters, in the sense that each locus of constant entropy in parameter space is a connected…

We review results of papers written on the topic of polynomial amoebas with an emphasis on computational aspects of the topic. The polynomial amoebas have a lot of applications in various domains of science. Computation of the amoeba for a…

It has been known for some time that the topological entropy is a nondecreasing function of the parameter in the real quadratic family, which corresponds to the intuitive idea that more nonlinearity induces more complex dynamical behavior.…

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…

We present algorithms for computation and visualization of amoebas, their contours, compactified amoebas and sections of three-dimensional amoebas by two-dimensional planes. We also provide method and an algorithm for the computation…

For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…

Noncommutative topological entropy estimates are obtained for polynomial gauge invariant endomorphisms of Cuntz algebras, generalising known results for the canonical shift endomorphisms. Exact values for the entropy are computed for a…