Related papers: On continuing codes
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
Periodic-finite-type shifts (PFT's) form a class of sofic shifts that strictly contains the class of shifts of finite type (SFT's). In this paper, we investigate how the notion of "period" inherent in the definition of a PFT causes it to…
Generalizing the notion of the degree of a finite-to-one factor code from a shift of finite type, the class degree of a possibly infinite-to-one factor extends many important properties of degree. In this paper, introducing class degree, we…
We show that topological mixing, weak mixing and total transitivity are equivalent for coded systems. We provide an example of a mixing coded system which cannot be approximated by any increasing sequence of mixing shifts of finite type,…
Exel and Renault proved that a sliding block code on a one-sided shift space coming from a progressive block map is a local homeomorphism. We provide a counterexample showing that the converse does not hold. We use this example to…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
The continuity problem, i.e., the question whether effective maps between effectively given topological spaces are effectively continuous, is reconsidered. In earlier work it was shown that this is always the case, if the effective map also…
We show that a shift space on a finite alphabet with a non-uniform specification property can be modeled by a strongly positive recurrent countable-state Markov shift to which every equilibrium state lifts. In addition to uniqueness of the…
It is possible to define mixing properties for subshifts according to the intensity which allows to concatenate two rectangular blocks. We study the interplay between this intensity and computational properties. In particular we prove that…
In skew-product systems with contractive factors, all orbits asymptotically approach the graph of the so-called sync function; hence, the corresponding regularity properties primarily matter. In the literature, sync function Lipschitz…
We study a class of $\Z^{d}$-substitutive subshifts, including a large family of constant-length substitutions, and homomorphisms between them, i.e., factors modulo isomorphisms of $\Z^{d}$. We prove that any measurable factor map and even…
We study the concept of a code (or shift) space for a generalized iterated function system (GIFS in short). We prove that relations between GIFSs and their code spaces are analogous to the case of classical IFSs. As an application, we…
As a variant of the equal entropy cover problem, we ask whether all multidimensional sofic shifts with countably many configurations have SFT covers with countably many configurations. We answer this question in the negative by presenting…
In this work, we prove that every SFT, sofic shift, and strongly irreducible shift on locally finite groups has strong dynamical properties. These properties include that every sofic shift is an SFT, every SFT is strongly irreducible, every…
Given a strictly positive measure, we characterize inner semicontinuous solid convex-valued mappings for which continuous functions which are selections almost everywhere are selections. This class contains continuous mappings as well as…
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…
Scaling-invariant functions preserve the order of points when the points are scaled by the same positive scalar (with respect to a unique reference point). Composites of strictly monotonic functions with positively homogeneous functions are…
Is it true that the left and the right uniformities on a topological group coincide as soon as every left uniformly continuous real valued function is right uniformly continuous? This question is known as Itzkowitz's problem, and it is…
We show that there is no Curtis-Hedlund-Lyndon Theorem for factor maps between tiling dynamical systems: there are codes between such systems which cannot be achieved by working within a finite window. By considering 1-dimensional tiling…
A long standing problem in the area of error correcting codes asks whether there exist good cyclic codes. Most of the known results point in the direction of a negative answer. The uncertainty principle is a classical result of harmonic…