English
Related papers

Related papers: (M + 1)-step shift spaces that are not conjugate t…

200 papers

Ott, Tomforde, and Willis proposed a useful compactification for one-sided shifts over infinite alphabets. Building from their idea we develop a notion of two-sided shift spaces over infinite alphabets, with an eye towards generalizing a…

Dynamical Systems · Mathematics 2018-02-15 Daniel Gonçalves , Marcelo Sobottka , Charles Starling

In this paper we further develop the theory of one sided shift spaces over infinite alphabets, characterizing one-step shifts as edge shifts of ultragraphs and partially answering a conjecture regarding shifts of finite type (we show that…

Dynamical Systems · Mathematics 2015-10-19 Daniel Gonçalves , Danilo Royer

We define a notion of (one-sided) shift spaces over infinite alphabets. Unlike many previous approaches to shift spaces over countable alphabets, our shift spaces are compact Hausdorff spaces. We examine shift morphisms between these shift…

Operator Algebras · Mathematics 2013-07-03 William Ott , Mark Tomforde , Paulette Willis

The aim of this article is to find appropriate definitions for shifts of finite type and sofic shifts in a general context of symbolic dynamics. We start showing that the classical definitions of shifts of finite type and sofic shifts, as…

Dynamical Systems · Mathematics 2022-03-31 Marcelo Sobottka

We introduce and study a unital version of shift equivalence for finite square matrices over the nonnegative integers. In contrast to the classical case, we show that unital shift equivalence does not coincide with one-sided eventual…

Dynamical Systems · Mathematics 2025-04-15 Kevin Aguyar Brix , Efren Ruiz

We introduce the notion of balanced strong shift equivalence between square nonnegative integer matrices, and show that two finite graphs with no sinks are one-sided eventually conjugate if and only if their adjacency matrices are conjugate…

Operator Algebras · Mathematics 2020-12-11 Kevin Aguyar Brix

In this work we propose a new type of shift spaces, called blur shift spaces, where one can represent with a single symbol an entire set of infinite symbols. Such shift spaces are constructed from classical shift spaces, by choosing some…

Dynamical Systems · Mathematics 2021-08-31 Tadeu Zavistanovicz Almeida , Marcelo Sobottka

We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…

Operator Algebras · Mathematics 2017-05-19 Daniel Gonçalves , Danilo Royer

The class of normal subshifts includes irreducible infinite topological Markov shifts, irreducible infinite sofic shifts, synchronized systems, Dyck shifts, $\beta$-shifts, substitution minimal shifts, and so on. We will characterize…

Operator Algebras · Mathematics 2021-04-13 Kengo Matsumoto

Motivated by importance of operator spaces contained in the set of all scalar multiples of isometries ($MI$-spaces) in a separable Hilbert space for $C^*$-algebras and E-semigroups we exhibit more properties of such spaces. For example, if…

Operator Algebras · Mathematics 2008-05-23 Waclaw Szymanski

In this work we characterize shift spaces over infinite countable alphabets that can be endowed with an inverse semigroup operation. We give sufficient conditions under which zero-dimensional inverse semigroups can be recoded as shift…

Dynamical Systems · Mathematics 2018-02-15 Daniel Gonçalves , Marcelo Sobottka , Charles Starling

We introduce a new extension in symbolic dynamics on two sets of alphabets, called the zip shift space. In finite case, it represents a finite-to-1 local homeomorphism called zip shift map. Such extension, offers a conjugacy between some…

Dynamical Systems · Mathematics 2025-02-18 Sanaz Lamei , Pouya Mehdipour

In this paper we study the conjugacy relation on one-sided subshifts in the viewpoint of descriptive set theory. We show the conjugacy relation on one sided subshifts with the alphabet set $\{0,1\}$ is non-treeable and non-amenable.

Logic · Mathematics 2026-03-06 Ruiwen Li

In the following text we compute the adjoint of weighted generalized shift operators over Hilbert spaces. We show for a conjugate invariant subset $A$ of $\mathbb C$, the additive semigroup generated by $A\cup\{0\}-$weighted generalized…

Functional Analysis · Mathematics 2024-04-02 F. Ayatollah Zadeh Shirazi , E. Hakimi , A. Hosseini , R. Rezavand

We show that every binary shift on the hyperfinite $II_1$ factor $R$ is cocycle conjugate to at least countably many non-conjugate binary shifts. This holds in particular for binary shifts of infinite commutant index.

Operator Algebras · Mathematics 2016-02-19 Geoffrey L. Price

We study multidimensional minimal and quasiperiodic shifts of finite type. We prove for these classes several results that were previously known for the shifts of finite type in general, without restriction. We show that some quasiperiodic…

Discrete Mathematics · Computer Science 2021-07-01 Bruno Durand , Andrei Romashchenko

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…

Dynamical Systems · Mathematics 2018-09-14 Vaughn Climenhaga

We introduce a new family of shift spaces --- the subordinate shifts. Using subordinate shifts we prove in an elementary way that for every nonnegative real number $t$ there is a shift space with entropy $t$.

Dynamical Systems · Mathematics 2018-02-01 Marcin Kulczycki , Dominik Kwietniak , Jian Li

We show that the automorphism group of a one-dimensional full shift (the group of reversible cellular automata) does not satisfy the Tits alternative. That is, we construct a finitely-generated subgroup which is not virtually solvable yet…

Dynamical Systems · Mathematics 2019-01-30 Ville Salo

We prove that it is decidable whether a one-sided shift of finite type is conjugate to a one-sided Hom-shift, and whether a tree-shift of finite type is conjugate to a Hom tree-shift. The proof uses Williams's theory for one-sided shifts

Formal Languages and Automata Theory · Computer Science 2025-09-30 Marie-Pierre Béal , Alexi Block Gorman
‹ Prev 1 2 3 10 Next ›