相关论文: Textile systems on lambda-graph systems

$\lambda$-graph systems are labeled Bratteli diagram with shift operations. They present subshifts. Their matrix presentations are called symbolic matrix systems. We define skew products of $\lambda$-graph systems and study extensions of…

We introduce a notion of $\lambda$-graph bisystem. It consists of a pair $({\frak L}^-, {\frak L}^+)$ of two labeled Bratteli diagrams ${\frak L}^-, {\frak L}^+$ over alphabets $\Sigma^-, \Sigma^+$, respectively, and satisfy certain…

Kengo Matsumoto has introduced lambda-graph systems and strong shift equivalence of lambda-graph systems [Doc.Math.4 (1999), 285-340]. We associate to a subshift of a subshift a lambda-graph system. The strong shift equivalence class of the…

Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…

We develop some aspects of a general theory of presentations of subshifts by labelled directed graphs, in particular by compact graphs. Also considered are synchronization properties of subshifts that lead to presentations by countable…

The graphical operation of insplitting is key to understanding conjugacy of shifts of finite type (SFTs) in both one and two dimensions. In this paper, we consider two approaches to studying 2-dimensional SFTs: textile systems and rank-2…

We present a graph-theoretic model for dynamical systems $(X,\sigma)$ given by a surjective local homeomorphism $\sigma$ on a totally disconnected compact metrizable space $X$. In order to make the dynamics appear explicitly in the graph,…

It is shown how to model any automorphism of a totally disconnected, locally compact group by a symbolic dynamical system. The model is an inverse limit of a product of a full-shift, on a finite number of symbols, with one of two types of…

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…

The paper gives a characterisation of the chain relation of a sofic subshift. Every sofic subshift $\Sigma$ can be described by a labelled graph $G$. Factorising $G$ in a suitable way we obtain the graph $G/_\approx$ that offers insight…

A $\lambda$-graph system is a labeled Bratteli diagram with some additional structure, which presents a subshift and yields a $C^*$-algebra. In this paper, we construct a $\lambda$-graph system from a pushdown automaton, such that the…

For a rational map $\phi$ from a metric graph $\varGamma$ to a tropical projective space $\boldsymbol{TP^n}$ defined by a ratio of rational functions $f_1, \ldots, f_{n + 1}$, an automorphism $\sigma$ of $\varGamma$ induces a permutation of…

The study of subshifts on groups different from $\mathbb{Z}$, such as $\mathbb{Z}^d$, $d\geq 2$, has been a subject of intense research in recent years. These investigations have unveiled aremarkable connection between dynamics and…

The high degrees of freedom and complex structure of garments present significant challenges for clothing manipulation. In this paper, we propose a general topological dynamics model to fold complex clothing. By utilizing the visible…

There is a deep and interesting connection between the topological properties of a graph and the behaviour of the dynamical system defined on it. We analyse various kind of graphs, with different contrasting connectivity or degree…

We give an introduction to the "stable algebra of matrices" as related to certain problems in symbolic dynamics. We consider this stable algebra (especially, shift equivalence and strong shift equivalence) for matrices over general rings as…

Let $\pi : X\to \Lambda$ be a flat family of smooth complex projective varieties parameterized by a smooth quasi-projective variety $\Lambda$, and let $f: X\to X$ be a family of automorphisms with positive topological entropy. Suppose…

In this article, we study flag-transitive automorphism groups of non-trivial symmetric $(v, k, \lambda)$ designs, where $\lambda$ divides $k$ and $k\geq \lambda^2$. We show that such an automorphism group is either point-primitive of affine…

An automorphism of a graph $G=(V,E)$ is a bijective map $\phi$ from $V$ to itself such that $\phi(v_i)\phi(v_j)\in E$ $\Leftrightarrow$ $v_i v_j\in E$ for any two vertices $v_i$ and $v_j$. Denote by $\mathfrak{G}$ the group consisting of…

This paper presents a general and systematic discussion of various symbolic representations of iterated maps through subshifts. We give a unified model for all continuous maps on a metric space, by representing a map through a general…