Related papers: Encoding subshifts through sliding block codes

We construct a manifestly Machian theory of gravitation on the foundation that information in the universe cannot be destroyed (Landauer's principle). If no bit of information in the Universe is lost, than the sum of the entropies of the…

In this paper, we compute categorical entropy of spherical twists. In particular, we prove that Gromov-Yomdin type conjecture holds for spherical twists. Moreover, we construct counterexamples of Gromov-Yomdin type conjecture for K3…

Let $X$ be a two-sided subshift on a finite alphabet endowed with a mixing probability measure which is positive on all cylinders in $X$. We show that there exist arbitrarily small finite overlapping union of shifted cylinders which…

The notion of entropy dimension has been introduced to measure the subexponential complexity of zero entropy systems. In this work we present a general construction of a strictly ergodic subshift of topological entropy dimension $\alpha$…

Statements of Shannon's Noiseless Coding Theorem by various authors, including the original, are reviewed and clarified. Traditional statements of the theorem are often unclear as to when it applies. A new notation is introduced and the…

Term Coding asks: given a finite system of term identities $\Gamma$ in $v$ variables, how large can its solution set be on an $n$--element alphabet, when we are free to choose the interpretations of the function symbols? This turns familiar…

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

We put forth a new computational notion of entropy, measuring the (in)feasibility of sampling high-entropy strings that are consistent with a given generator. Specifically, the i'th output block of a generator G has accessible entropy at…

We introduce the notion of induced topological pressure for countable state Markov shifts with respect to a non-negative scaling function and an arbitrary subset of finite words. Firstly, the scaling function allows a direct access to…

In this paper, we define the so-called square entropy and prove that n-to-1 full zip shift maps are intrinsically ergodic. Furthermore, we show that square entropy characterizes uniform n-to-1 transformations of $(m,l)$-Bernoulli type that…

Distributed representations of words encode lexical semantic information, but what type of information is encoded and how? Focusing on the skip-gram with negative-sampling method, we found that the squared norm of static word embedding…

A coding theorem and converse are proved for a large class of abstract stationary channels with time structure including the result by Kadota and Wyner (1972) on continuous-time real-valued channels as special cases. As main contribution…

There are a variety of results in the literature proving forms of computability for topological entropy and pressure on subshifts. In this work, we prove two quite general results, showing that topological pressure is always computable from…

Based on our previous graph covering method, we introduce weighted graph covering models and flexible graph covering models that are almost equivalent to the well-known Bratteli--Vershik models. These models play important roles in showing…

A consistent theory of supersymmetry breaking must have a hidden sector, an observable sector, and must be embedded in a locally supersymmetric theory which arises from string theory. For phenomenological reasons it must also transmit…

Let $G$ be a countable discrete sofic group. We define a concept of uniform mixing for measure-preserving $G$-actions and show that it implies completely positive sofic entropy. When $G$ contains an element of infinite order, we use this to…

A measure of how sensitive the entanglement entropy is in a quantum system, has been proposed and its information geometric origin is discussed. It has been demonstrated for two exactly solvable spin systems, that thermodynamic criticality…

Image forensics has become increasingly crucial in our daily lives. Among various types of forgeries, copy-move forgery detection has received considerable attention within the academic community. Keypoint-based algorithms, particularly…

Subshifts are sets of colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissible completions. Since soficity of $\mathbb{Z}$ subshifts is…

In this paper, we propose a mild condition, named Condition $(**)$, for collections of sequence of integers and show that for any measure preserving system the Pinsker $\sigma$-algebra is a characteristic $\sigma$-algebra for the averages…