Related papers: Entropy in Dimension One
In this paper, we show that each expanding Thurston map $f : S^2\rightarrow S^2$ has $1+ deg f$ fixed points, counted with appropriate weight, where $ deg f$ denotes the topological degree of the map $f$. We then prove the equidistribution…
We show that for the standard map family, for all values of the parameter, except one, the mapping has positive topological entropy. The main tool is the following result. Let $S$ be a compact connected orientable surface and $f:S…
We introduce and study a new topological notion of the size for subsets of the real line, called \emph{super-density}. A set $A\subset\mathbb{R}$ is super-dense if for every non-empty open interval $I$ and every nowhere constant continuous…
We discuss algorithms for estimating the Shannon entropy h of finite symbol sequences with long range correlations. In particular, we consider algorithms which estimate h from the code lengths produced by some compression algorithm. Our…
We study topological entropy of exactly Devaney chaotic maps on totally regular continua, i.e. on (topologically) rectifiable curves. After introducing the so-called P-Lipschitz maps (where P is a finite invariant set) we give an upper…
This paper introduces Haros graphs, a construction which provides a graph-theoretical representation of real numbers in the unit interval reached via paths in the Farey binary tree. We show how the topological structure of Haros graphs…
How can we interpret the infimum of Lipschitz constants in a conjugacy class of interval maps? For positive entropy maps, the exponential of the topological entropy gives a well-known lower bound. We show that for piecewise monotone…
The $n$-grid $E_n$ consists of $n$ equally spaced points in $[-1,1]$ including the endpoints $\pm 1$. The extremal polynomial $p_n^*$ is the polynomial that maximizes the uniform norm $\| p \|_{[-1,1]}$ among polynomials $p$ of degree $\leq…
A power-free language is characterized by the number of symbols used and a limit on how many times a block of symbols can repeat consecutively. For certain values of these parameters, it is known that the number of legal words grows…
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that,…
Given any postsingularly finite exponential function $p_\lambda(z) = \lambda \exp(z)$ where $\lambda \in \C^*$, we construct a sequence of postcritically finite unicritical polynomials $p_{d,\lambda_d}(z) = \lambda_d(1+\frac{z}{d})^d$ that…
The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. Its correct interpretation as a measure of uniformity of the degree sequence requires the determination of its extremal…
We survey the connections between entropy, chaos, and independence in topological dynamics. We present extensions of two classical results placing the following notions in the context of symbolic dynamics: 1. Equivalence of positive entropy…
One of the aims of this paper is to obtain structural results showing that powerful subgroups are abundant in pro-$p$ groups admitting certain powerful quotients. In particular, we obtain an analogue of Baer's theorem for powerful pro-$p$…
The classical problem of maximizing the Shannon entropy of a sum of independent random variables supported on a finite alphabet is considered and settled in the ternary case. Namely, the following theorem is established: if…
It is well known that the entropy $H(X)$ of a discrete random variable $X$ is always greater than or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tight…
For certain groups, parabolic subgroups appear as stabilizers of flags of sets or vector spaces. Quotients by these parabolic subgroups represent orbits of flags, and their cardinalities asymptotically reveal entropies (as rates of…
Local correlation entropy, introduced by Takens in 1983, represents the exponential decay rate of the relative frequency of recurrences in the trajectory of a point, as the embedding dimension grows to infinity. In this paper we study…
Let $(X,d,f)$ be a topological dynamical system, where $(X,d)$ is a compact metric space and $f:X\to X$ is a continuous map. We define $n$-ordered empirical measure of $x\in X$ by \begin{align*}…
Rank/Select dictionaries are data structures for an ordered set $S \subset \{0,1,...,n-1\}$ to compute $\rank(x,S)$ (the number of elements in $S$ which are no greater than $x$), and $\select(i,S)$ (the $i$-th smallest element in $S$),…