Related papers: Continuity of core entropy of quadratic polynomial…
Cyclically ordered graphs, or cogs, sit between abstract graphs and cellularly embedded graphs. They arise naturally in topological graph theory, knot theory, and mathematical biology. We develop a formal theory of cogs and establish a…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
Entropy is a concept that has traditionally been reliant on a definite notion of causality. However, without a definite notion of causality, the concept of entropy is not all lost. Indefinite causal structure results from combining…
The logarithm of the number of Eulerian orientations, normalised by the number of vertices, is known as the residual entropy in studies of ice-type models on graphs. The spanning tree entropy depends similarly on the number of spanning…
Uncertainty relations are central to quantum physics. While they were originally formulated in terms of variances, they have later been successfully expressed with entropies following the advent of Shannon information theory. Here, we…
We give a notion of entropy for general gemetric structures, which generalizes well-known notions of topological entropy of vector fields and geometric entropy of foliations, and which can also be applied to singular objects, e.g. singular…
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 prove that the entropy function on the moduli space of real quadratic rational maps is not monotonic by exhibiting a continuum of disconnected level sets. This entropy behavior is in stark contrast with the case of polynomial maps, and…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
We study the dependence of the topological entropy of piecewise monotonic maps with holes under perturbations, for example sliding a hole of fixed size at uniform speed or expanding a hole with uniform expansion. We show that under suitable…
We discuss the entropy of a circular polymer under a topological constraint. We call it the {\it topological entropy} of the polymer, in short. A ring polymer does not change its topology (knot type) under any thermal fluctuations. Through…
Expanding Thurston maps were introduced by M. Bonk and D. Meyer with motivation from complex dynamics and Cannon's conjecture from geometric group theory via Sullivan's dictionary. In this paper, we show that the entropy map of an expanding…
The eccentric pie chart, a generalization of the traditional pie chart is introduced. An arbitrary point is fixed within the circle and rays are drawn from it. A sector is bounded by a pair of neighboring rays and the arc between them, The…
The structure of isentropes (i.e. level sets of constant topological entropy) including the monotonicity of entropy, has been studied for polynomial interval maps since the 1980s. We show that isentropes of multimodal polynomial families…
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
We investigate the symmetry component of the center variety of polynomial differential systems, corresponding to systems with an axis of symmetry in the real plane. We give a general algorithm to find this irreducible subvariety and compute…
Milnor and Thurston's famous paper proved monotonicity of the topological entropy for the real quadratic family. Guckenheimer showed that it is H\"older continuous. We obtain a precise formula for the H\"older exponent at almost every…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…