Related papers: Subshifts on groups and computable analysis
We study the density of periodic configurations for shift spaces defined on (the Cayley graph of) a finitely generated group. We prove that in the case of a full shift on a residually finite group and in that of a group shift space on an…
We study the parametrized complexity of fundamental relations between multidimensional subshifts, such as equality, conjugacy, inclusion, and embedding, for subshifts of finite type (SFTs) and effective subshifts. We build on previous work…
The purpose of this paper is to constructively develop a Galois theory on irreducible shifts of finite type (SFTs) and to analyze the automorphism groups of SFTs using this framework. Let $X$ and $Y$ be irreducible SFTs. We demonstrate that…
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…
In this article we continue the study of automorphism groups of constant length substitution shifts and also their topological factors. We show that up to conjugacy, all roots of the identity map are letter exchanging maps, and all other…
This paper focuses on flow-adapted point-shifts of point processes on topological groups, which map points of a point process to other points of the point process in a translation invariant way. Foliations and connected components generated…
We study the problem of realizing families of subgroups as the set of stabilizers of configurations from a subshift of finite type (SFT). This problem generalizes both the existence of strongly and weakly aperiodic SFTs. We show that a…
For a finite digraph $D$, we define the corresponding subshift of finite type $(X_D, \sigma_D)$ to be the dynamical system where $X_D$ is the set of all bi-infinite walks through $D$ and $\sigma_D$ is the shift operator. Two digraphs $D_1$…
We show that, for every finitely generated group with decidable word problem and undecidable domino problem, there exists a sequence of effective subshifts whose inverse limit is not the topological factor of any effective dynamical system.…
Motivated by Ziegler's computability-theoretic characterisation of finite absolute presentability between groups, we prove an analogous theorem in symbolic dynamics. We introduce the notion of one subshift being finitely determined over…
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…
We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…
In this paper we study some basic problems about Toeplitz subshifts of finite topological rank. We define the notion of a strong Toeplitz subshift of finite rank $K$ by combining the characterizations of Toeplitz-ness and of finite…
Systems obtained by quotienting a subshift of finite type (SFT) by another SFT are called finitely presented in the literature. Analogously, if a sofic shift is quotiented by a sofic equivalence relation, we call the resulting system…
We propose a definition of graph subshifts of finite type that can be seen as extending both the notions of subshifts of finite type from classical symbolic dynamics and finitely presented groups from combinatorial group theory. These are…
In this paper we relate the study of actions of discrete groups over connected manifolds to that of their orbit spaces seen as differentiable stacks. We show that the orbit stack of a discrete dynamical system on a simply connected manifold…
We study Markov multi-maps of the interval from the point of view of topological dynamics. Specifically, we investigate whether they have various properties, including topological transitivity, topological mixing, dense periodic points, and…
We discuss a method of calculating the zeta function of subshifts which have a presentation by a finite directed graph labeled by elements of the associated inverse semigroup. This class of subshifts is introduced as a class of property A…
A Polish group $G$ has the generic point property if any minimal $G$-flow admits a comeager orbit, or equivalently if the universal minimal flow (UMF) does. The class $\mathsf{GPP}$ of such Polish groups is a proper extension of the class…
Recently it was shown that the notion of flow equivalence of shifts of finite type in symbolic dynamics is related to the Morita theory and the Grothendieck group in the theory of Leavitt path algebras \cite{flowa}. In this paper we show…