Related papers: Metrics on trees I. The tower algorithm for interv…
The purpose of this paper is to present a weighted kneading theory for unidimensional maps with holes. We consider extensions of the kneading theory of Milnor and Thurston to expanding discontinuous maps with holes and introduce weights in…
This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…
The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…
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,…
We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm is obtained by the sign analysis of the itineraries of…
We construct a version of kneading theory for families of monotonous functions on the real line. The generality of the setup covers two classical results from Milnor-Thurston's kneading theory: the first one is to dynamically characterise…
In this paper we prove that the monotonicity of kneading sequences and topological entropy, a fundamental structural property of the quadratic family, extends to the class of power-law unimodal maps $f_a(x)=a-|x|^r$ for arbitrary critical…
In this paper we will modify the Milnor--Thurston map, which maps a one dimensional mapping to a piece-wise linear of the same entropy, and study its properties. This will allow us to give a simple proof of monotonicity of topological…
In connection with the Entropy Conjecture it is known that the topological entropy of a continuous graph map is bounded from below by the spectral radius of the induced map on the first homology group. We show that in the case of a…
In approximation algorithm design, light spanners has applications in graph-metric problems such as metric TSP (the traveling salesman problem). We have developed an efficient algorithm for light spanners in bounded pathwidth graphs, based…
We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicity) and so the values of two consecutive points do not increase by too…
We investigate the flexibility of the entropy (topological and metric) for the class of piecewise expanding unimodal maps. We show that the only restrictions for the values of the topological and metric entropies in this class are that both…
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…
The tree metric theorem provides a combinatorial four point condition that characterizes dissimilarity maps derived from pairwise compatible split systems. A similar (but weaker) four point condition characterizes dissimilarity maps derived…
In this work we study the Artin-Mazur zeta function for piecewise monotone functions acting on a compact interval of real numbers. In the case of unimodal maps, Milnor and Thurston gave a characterization for the rationality of the…
We consider perturbations of interval maps with indifferent fixed points, which we refer to as wobbly interval intermittent maps, for which stable laws for general H\"older observables fail. We obtain limit laws for such maps and H\"older…
Let $f$ be a piecewise continuous and monotonic map on the interval with at most finitely many discontinuities and turning points. In this paper we study properties about this class of maps and show its main difference from the continuous…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
In \cite{Mil}, Milnor posed the {\em Monotonicity Conjecture} that the set of parameters within a family of real multimodal polynomial interval maps, for which the topological entropy is constant, is connected. This conjecture was proved…
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.