Related papers: One-sided Hom shifts
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.
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…
It is known that a group shift on a polycyclic group is necessarily of finite type. We show that, for trivial reasons, if a group does not satisfy the maximal condition on subgroups, then it admits non-SFT abelian group shifts. In…
The uncertainty of multidimensional shift spaces draws attracted attention of researchers. For example, the emptiness problem is undecidable; there exist aperiodic shifts of finite type; there is a nonempty shift of finite type exhibiting…
In this paper, we study the independence of shifts defined on $\mathbb{N}^d$ ($\mathbb{N}^d$ shift) and trees (tree-shift). Firstly, for the completeness of the article, we provide a proof that an $\mathbb{N}^d$ shift has positive…
Unbounded complex symmetric weighted shifts are studied. Complex symmetric unilateral weighted shifts whose $C^\infty$ vectors contain the image of the canonical orthonormal basis under the conjugation are shown to be decomposable into an…
We define class-closing factor codes from shifts of finite type and show that they are continuing if their images are of finite type. We establish several relations between class-closing factor codes, continuing factor codes and…
This paper deals with the topological entropy for hom Markov shifts $\mathcal{T}_M$ on $d$-tree. If $M$ is a reducible adjacency matrix with $q$ irreducible components $M_1, \cdots, M_q$, we show that $h(\mathcal{T}_{M})=\max_{1\leq i\leq…
We consider tiling dynamical systems and topological conjugacies between them. We prove that the criterion of being finite type is invariant under topological conjugacy. For substitution tiling systems under rather general conditions,…
We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT),…
A new class of (not necessarily bounded) operators related to (mainly infinite) directed trees is introduced and investigated. Operators in question are to be considered as a generalization of classical weighted shifts, on the one hand, and…
The HOM-problem, which asks whether the image of a regular tree language under a tree homomorphism is again regular, is known to be decidable. Since then, weighted versions of this problem for different semirings have also been…
We study the shifted convolution sums associated to completely multiplicative functions taking values in $\{\pm 1\}$ and give combinatorical proofs of two recent results in the direction of Chowla's conjecture. We also determine the…
We prove `twisted' versions of Kirchhoff's network theorem and Kirchhoff's matrix-tree theorem on connected finite graphs. Twisting here refers to chains with coefficients in a flat unitary line bundle.
We introduce a notion of coded equivalence in one-sided topological Markov shifts. The notion is inspired by coding theory. One-sided topological conjugacy implies coded equivalence. We will show that coded equivalence implies continuous…
We prove for residually finite groups the following long standing conjecture: the number of twisted conjugacy classes of an automorphism of a finitely generated group is equal (if it is finite) to the number of finite dimensional…
A profinite group equipped with an expansive endomorphism is equivalent to a one-sided group shift. We show that these groups have a very restricted structure. More precisely, we show that any such group can be decomposed into a finite…
We give three new proofs of a theorem of C. Sabbah asserting that the weight filtration of the limit mixed Hodge structure at infinity of cohomologically tame polynomials coincides with the monodromy filtration up to a certain shift…
We study the conjugacy problem in the automorphism group $Aut(T)$ of a regular rooted tree $T$ and in its subgroup $FAut(T)$ of finite-state automorphisms. We show that under the contracting condition and the finiteness of what we call the…
We review a combinatoric approach to the Hodge Conjecture for Fermat Varieties and announce new cases where the conjecture is true.