相关论文: On entropy and intrinsic ergodicity of coded subsh…

We study ergodic-theoretic properties of coded shift spaces. A coded shift space is defined as a closure of all bi-infinite concatenations of words from a fixed countable generating set. We derive sufficient conditions for the uniqueness of…

For any fixed alphabet A, the maximum topological entropy of a Z^d subshift with alphabet A is obviously log |A|. We study the class of nearest neighbor Z^d shifts of finite type which have topological entropy very close to this maximum,…

Let $(X,d,T )$ be a topological dynamical system with specification property. For $ \alpha\in \mathbb R^+$ and any $x_0\in X$, define $$ \mathbf D^{x_0}_\alpha :=\Big\{x\in X: \lim\limits_{\epsilon\to…

Let $G$ be a discrete, countably infinite group and $H$ a subgroup of $G$. If $H$ acts continuously on a compact metric space $X$, then we can induce a continuous action of $G$ on $\prod_{H\backslash G}X$ where $H\backslash G$ is the…

We show that a synchronized coded system $X$ is intrinsically ergodic of full support if and only if $ h(Y)$, the topological entropy of $Y$, is less than $h(X) $ whenever $Y$ is a proper subsystem of $ X $. We also show that like systems…

Let $(X, T)$ be a topological dynamical system (TDS), and $h (T, K)$ the topological entropy of a subset $K$ of $X$. $(X, T)$ is {\it lowerable} if for each $0\le h\le h (T, X)$ there is a non-empty compact subset with entropy $h$; is {\it…

We consider scaling of the entanglement entropy across a topological quantum phase transition in one dimension. The change of the topology manifests itself in a sub-leading term, which scales as $L^{-1/\alpha}$ with the size of the…

We show that an arbitrary factor map $\pi:X \to Y$ on an irreducible subshift of finite type is a composition of a finite-to-one factor code and a class degree one factor code. Using this structure theorem on infinite-to-one factor codes,…

Let $G$ be the group $\mathbb{Z}^d$ or the monoid $\mathbb{N}^d$ where $d$ is a positive integer. Let $X$ be a subshift over $G$, i.e., a closed and shift-invariant subset of $A^G$ where $A$ is a finite alphabet. We prove that the…

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…

We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…

We calculate exactly the von Neumann and topological entropies of the toric code as a function of system size and temperature. We do so for systems with infinite energy scale separation between magnetic and electric excitations, so that the…

It is well known that the entropy $H(X)$ of a finite random variable is always greater 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 tights bounds on…

We define a one-parameter family of entropies, each assigning a real number to any probability measure on a compact metric space (or, more generally, a compact Hausdorff space with a notion of similarity between points). These entropies…

The notion of topological entropy can be conceptualized in terms of the number of forward trajectories that are distinguishable at resolution $\varepsilon$ within $T$ time units. It can then be formally defined as a limit of a limit…

We prove that there is no algorithm to decide whether a given integer vector is in the closure of the entropic cone $\overline{\Gamma_{n}^{*}}$. Equivalently, there is no decision procedure to determine whether a given integer-valued…

The entanglement properties of a class of topological stabilizer states, the so called \emph{topological color codes} defined on a two-dimensional lattice or \emph{2-colex}, are calculated. The topological entropy is used to measure the…

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 study the topological entropy of hom tree-shifts and show that, although the topological entropy is not a conjugacy invariant for tree-shifts in general, it remains invariant for hom tree higher block shifts. In…

In this paper we propose a revisitation of the topic of unique decodability and of some fundamental theorems of lossless coding. It is widely believed that, for any discrete source X, every "uniquely decodable" block code satisfies E[l(X_1…