Related papers: On Flow Equivalence of Sofic Shifts
A canonical cover generalizing the left Fischer cover to arbitrary sofic shifts is introduced and used to prove that the left Krieger cover and the past set cover of a sofic shift can be divided into natural layers. These results are used…
The Fischer, Krieger, and fiber product covers of sofic beta-shifts are constructed and used to show that every strictly sofic beta-shift is $2$-sofic. Flow invariants based on the covers are computed, and shown to only depend on an single…
We classify certain sofic shifts (the irreducible Point Extension Type, or PET, sofic shifts) up to flow equivalence, using invariants of the canonical Fischer cover. There are two main ingredients: (1) An extension theorem, for extending…
We prove that the Karoubi envelope of a shift --- defined as the Karoubi envelope of the syntactic semigroup of the language of blocks of the shift --- is, up to natural equivalence of categories, an invariant of flow equivalence. More…
Is every irreducible shift of finite type flow equivalent to a renewal system? For the first time, this variation of a classic problem formulated by Adler is investigated, and several partial results are obtained in an attempt to find the…
In this paper we show that the reducibility structure of several covers of sofic shifts is a flow invariant. In addition, we prove that for an irreducible subshift of almost finite type the left Krieger cover and the past set cover are…
We study two problems related to flow equivalence of shift spaces. The first problem, the classification of $S$-gap shifts up to flow equivalence, is partially solved with the establishment of a new invariant for the sofic $S$-gap shifts…
We will study a certain synchronizing property of subshifts called $\lambda$-synchronization. The $\lambda$-synchronizing subshifts form a large class of irreducible subshifts containing irreducible sofic shifts. We prove that the…
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…
A certain synchronizing property for subshifts called $\lambda$-synchronization yields $\lambda$-graph systems called the $\lambda$-synchronizing $\lambda$-graph systems for the subshifts. The $\lambda$-synchronizing $\lambda$-graph system…
We study basic properties of flow equivalence on one-dimensional compact metric spaces with a particular emphasis on isotopy in the group of (self-) flow equivalences on such a space. In particular, we show that an orbit-preserving such map…
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…
We show that the standard discrete update rule of transformer layers can be naturally interpreted as a forward Euler discretization of a continuous dynamical system. Our Transformer Flow Approximation Theorem demonstrates that, under…
In this paper, a G-shift of finite type (G-SFT) is a shift of finite type together with a free continuous shift-commuting action by a finite group G. We reduce the classification of G-SFTs up to equivariant flow equivalence to an algebraic…
Generative modeling seeks to uncover the underlying factors that give rise to observed data that can often be modeled as the natural symmetries that manifest themselves through invariances and equivariances to certain transformation laws.…
Shifts of finite type defined from shift equivalent matrices must be flow equivalent.
A sofic approximation to a countable group is a sequence of partial actions on finite sets that asymptotically approximates the action of the group on itself by left-translations. A group is sofic if it admits a sofic approximation. Sofic…
Flows on surfaces are one of the most fundamental and classical objects in dynamical systems, and are studied from various areas (e.g. integrable systems, differential equations, fluid mechanics). Though hyperbolic flows and recurrent flows…
We show that Property $(A)$ of subshifts and the semigroup, that is associated to subshifts with Property (A), are invariants of flow equivalence. We show for certain $\mathcal R$-graphs that their isomorphism is implied by the flow…
It is proved, with a no-go theorem of transforming all one type of real Schur matrices into the other type by the same (orthogonal) transformation, that the so-called real Schur flows (RSFs) corresponding to the two types of uniformly real…