Searcharxiv⌕ Search

arXiv subjects

Wolfgang Krieger

Publications and source records attributed to Wolfgang Krieger.

At least 19 recordsLinked to original sources

On synchronized coded systems

We introduce a class of codes with overlapping code words, that we call SPO-codes. The SPO-codes are related to the Markov codes that were introduced in: G. Keller, J. Combinatorial Theory 56, (1991),pp.\ 75--83. The process of generating a coded system from a code extends to SPO-codes. We describe a family of intrinsically ergodic synchronized SPO-coded systems that is closed under topological conjugacy. We construct synchronized subshifts with salient structural features by means of SPO-codes. We construct SPO-coded systems that are not semisynchronized.

math.DS↗

On the subsystems of certain sofic shifts

For an aperiodic subshift of finite type $Y$ and for a subshift $X$ with topological entropy less than the topological entropy of $Y$, a theorem is proved in Krieger: On the subsystems of topological Markov chains, Ergodic Theory \& dynamical systems 1982 $\bold{2}$, 195-202, that says that the necessary condition on the periodic points of $X$ and $Y$ for the existence of an embedding of $X$ into $Y$ is also sufficient for the existence of an embedding of $X$ into $Y$. In this note we point out that this theorem extends to certain classes of sofic shifts as target shifts.

math.DS↗

On certain labelled directed graphs of symbolic dynamics

We consider families of coded systems that contain the Dyck shifts and that are closed under topological conjugacy. We introduce a notion of hyposynchronization of subshifts. We introduce a notion of restricted complexity of hyposynchronizing subshifts. Restricted complexity of hyyposynchronizing subshift is not invariant under topological conjugacy. We construct explicitly a family of hyposynchronizing subshifts of restricted complexity that extends the family of Dyck shifts. The subshifts in this family are characterized by their restricted complexity in conjunction with a certain set of invariants of topological conjugacy that inclufdes the Artin-Mazur zeta function.

math.DS↗

A Construction of Subshifts and a Class of Semigroups

Subshifts with property $(A)$ are constructed from a class of directed graphs. As special cases the Markov-Dyck shifts are shown to have property $(A)$. The semigroups, that are associated to $\mathcal R$-graph shifts with Property (A), are determined. Also results on the reconstruction of $\mathcal R$-graphs from their $\mathcal R$-graph shifts are obtained.

math.DS↗

On images of sofic systems

Let $Σ$ and $\barΣ$ be finite alphabets. For topologically transitive sofic systems $ X\subset Σ^{\Bbb Z}$ and $\widetilde X\subset \widetildeΣ^{\Bbb Z}$ we give a necessary and sufficient condition for the existence of a homomorphism from $X$ to $\widetilde X$. For topologically mixing sofic systems $X \subset Σ^{\Bbb Z}$ and $\widetilde X\subset \widetildeΣ^{\Bbb Z}$, such that the topological entropy of $\widetilde X$ is less than the topological entropy of $X$, we give a necessary and sufficient condition for the existence of a homomorphism of $X$ onto $\widetilde X$.

math.DS↗

On subshift presentations

We consider partitioned graphs, by which we mean finite strongly connected directed graphs with a partitioned edge set $ {\mathcal E} ={\mathcal E}^- \cup{\mathcal E}^+$. With additionally given a relation $\mathcal R$ between the edges in ${\mathcal E}^-$ and the edges in $\mathcal E^+ $, and denoting the vertex set of the graph by ${\frak P}$, we speak of an an ${\mathcal R}$-graph ${\mathcal G}_{\mathcal R}({\frak P},{\mathcal E}^-,{\mathcal E}^+) $. From ${\mathcal R}$-graphs ${\mathcal G}_{\mathcal R}({\frak P},{\mathcal E}^-,{\mathcal E}^+) $ we construct semigroups (with zero) ${\mathcal S}_{\mathcal R}({\frak P}, {\mathcal E}^-,{\mathcal E}^+) $ that we call ${\mathcal R}$-graph semigroups. We describe a method of presenting subshifts by means of suitably structured labelled directed graphs $({\mathcal V}, Σ,λ)$ with vertex set ${\mathcal V}$, edge set $Σ$, and a label map that asigns to the edges in $Σ$ labels in an ${\mathcal R}$-graph semigroup ${\mathcal S}_{\mathcal R}({\frak P}, {\mathcal E}^-, {\mathcal E}^-)$. We call the presented subshift an ${\mathcal S}_{\mathcal R}({\frak P}, {\mathcal E}^-, {\mathcal E}^-)$-presentation. We introduce a Property $(B)$ and a Property (c), tof subshifts, and we introduce a notion of strong instantaneity. Under an assumption on the structure of the ${\mathcal R}$-graphs ${\mathcal G}_{\mathcal R}({\frak P},{\mathcal E}^-, {\mathcal E}^-)$ we show for strongly instantaneous subshifts with Property $(A)$ and associated semigroup ${\mathcal S}_{\mathcal R}({\frak P},{\mathcal E}^-,{\mathcal E}^-)$, that Properties $(B)$ and (c) are necessary and sufficient for the existence of an ${\mathcal S}_{\mathcal R}({\frak P}, {\mathcal E}^-,{\mathcal E}^-)$-presentation, to which the subshift is topologically conjugate,

math.DS↗

On flow-equivalence of R-graph shifts

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 equivalence of their $\mathcal R$-graph shifts.

math.DS↗

Excluding words from Dyck shifts

We study subshift that arise by excluding words of length two from Dyck shifts. The words that are to be excluded are taken from a finite set that is not literal-uniform.

math.DS↗

Subshifts from sofic shifts and Dyck shifts, zeta functions and topological entropy

We introduce a class of coded systems that we construct from sofic systems and Dyck shifts and we study a class of subshifts that we obtain by excluding words of length two from Dyck shifts. We derive expressions for zeta functions and topological entropy. We derive an expression for the zeta function of certain subshifts that we obtain by excluding words from Dyck shifts and of certain subshifts that we obtain by excluding words from the subshifts that are constructed from full shifts and Dyck shifts.

math.DS↗

On certain one-counter shifts

Extrapolating from the two-block system of an example of a nonsofic shift hat was given by Lind and Marcus, a class of one-counter shifts is described, that is disjoint from the class of standard one-counter shifts.

math.DS↗

Subshifts and C*-algebras from one-counter codes

We introduce a class of subshifts under the name of "standard one-counter shifts". The standard one-counter shifts are the Markov coded systems of certain Markov codes that belong to the family of one-counter languages. We study topological conjugacy and flow equivalence of standard one-counter shifts. To subshifts there are associated C*-algebras by their $λ$-graph systems. We describe a class of standard one-counter shifts with the property that the C*-algebra associated to them is simple, while the C*-algebra that is associated to their inverse is not. This gives examples of subshifts that are not flow equivalent to their inverse. For a family of highly structured standard one-counter shifts we compute the K-groups.

math.DS↗