Related papers: On g-functions for countable state subshifts
In this paper we provide sufficient conditions in order to show that the set image of a continuous and shift-commuting map defined on a shift space over an arbitrary discrete alphabet is also a shift space; additionally, if such a map is…
We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise…
In this paper we show that for every congruent monotileable amenable group $G$ and for every metrizable Choquet simplex $K$, there exists a minimal $G$-subshift, which is free on a full measure set, whose set of invariant probability…
We present a general necessary and sufficient criterion for the possibility of a state transformation from one mixed Gaussian state to another of a bi-partite continuous-variable system with two modes. The class of operations that will be…
In this paper, we continue studying the properties of $\gamma$-semi-continuous and $\gamma$-semi-open functions introduced in [5].
The aim of this paper is to pursue the investigation of the phase retrieval problem for the fractional Fourier transform $\ff\_\alpha$ started by the second author. We here extend a method of A.E.J.M Janssen to show that there is a…
The paper contains a new proof of the theorem by Krieger which establishes the canonicity of the future cover of a sofic shift. In addition the paper describes a method to produce new canonical covers from a given one, resulting in…
We present different extensions of the Banach contraction principle in the $G$-metric space setting. More precisely, we consider mappings for which the contractive condition is satisfied by a power of the mapping and for which the power…
For each countable residually finite group $G$, we present examples of irregular Toeplitz subshifts in $\{0,1\}^G$ that are topo-isomorphic extensions of its maximal equicontinuous factor. To achieve this, we first establish sufficient…
We give a sufficient condition for a symbolic topological dynamical system with action of a countable amenable group to be an extension of the full shift, a problem analogous to those studied by Ashley, Marcus, Johnson and others for…
In this paper we study substitutions on $A^\mathbb{Z}$ where $A$ is a finite alphabet. We precisely characterize the minimal components of substitution subshifts, give an optimal bound for their number and describe their dynamics. The…
Let $G$ be an infinite countable amenable group and let $(X,G)$ be a $G$-subshift with specification, containing a free element. We prove that $(X,G)$ is universal, i.e., has positive topological entropy and for any free ergodic $G$-action…
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…
A subshift on a group G is a closed, G-invariant subset of A^G, for some finite set A. It is said to be a subshift of finite type (SFT) if it is defined by a finite collection of 'forbidden patterns', to be strongly aperiodic if all point…
A complete characterization of near subnormality for bilateral weighted shifts is obtained. As an application of the main results, many new answers to the Hilbert space problem 160 are presented at the end of the paper.
Let G and H be two cographs. We show that the problem to determine whether H is a retract of G is NP-complete. We show that this problem is fixed-parameter tractable when parameterized by the size of H. When restricted to the class of…
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…
Given an irreducible sofic shift X, we show that an an irreducible SFT Y of lower entropy is a factor of X if and only if it is a factor of X by an open bi-continuing code. If these equivalent conditions hold and Y is mixing, then any code…
Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability…
We consider the problem of when a symbolic dynamical system supports a Borel probability measure that is invariant under every element of its automorphism group. It follows readily from a classical result of Parry that the full shift on…