相关论文: A correspondence between surjective local homeomor…

Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…

$\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…

The subdivision graph $S(\Sigma)$ of a connected graph $\Sigma$ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs $\Sigma$ such that $S(\Sigma)$ is…

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…

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…

Symbolic dynamics is partly the study of walks in a directed graph. By a walk, here we mean a morphism to the graph from the Cayley graph of the monoid of non-negative integers. Sets of these walks are also important in other areas, such as…

Given a compact space X and two commuting continuous open surjective maps sigma_1, sigma_2 : X --> X, we construct certain C*-algebras that reflect the dynamics of the N^2-action. When the maps sigma_1, sigma_2 are local homeomorphisms,…

In this article, we compare the dynamics of the shift map and its induced counterpart on the hyperspace of the shift space. We show that many of the properties of induced shift map can be easily demonstrated by appropriate sequences of…

A $\lambda$-graph system $\frak L$ is a labeled Bratteli diagram with shift operation. It is a generalized notion of finite labeled graph and presents a subshifts. We will study continuous orbit equivalence of one-sided subshifts and…

We describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…

A $\lambda$-graph system ${\frak L}$ is a generalization of a finite labeled graph and presents a subshift. We will prove that the topological dynamical systems $(X_{{\frak L}_1},\sigma_{{\frak L}_1})$ and $(X_{{\frak L}_2},\sigma_{{\frak…

For a group $G$ and a subset $X$ of $G$, the commuting graph of $X$, denoted by $\Gamma(G,X)$ is the graph whose vertex set is $X$ and any two vertices $u$ and $v$ in $X$ are adjacent if and only if they commute in $G$. In this article,…

We introduce a new class of partial actions of free groups on totally disconnected compact Hausdorff spaces, which we call convex subshifts. These serve as an abstract framework for the partial actions associated with finite separated…

Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…

The collective dynamics of interacting dynamical units on a network crucially depends on the properties of the network structure. Rather than considering large but finite graphs to capture the network, one often resorts to graph limits and…

Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their relations; to name all vertices relative to a point; and the fact that they have a well-defined notion of…

$S$-gap shifts are a well-studied class of shift spaces, which has led to several proposed generalizations. This paper introduces a new class of shift spaces called $\mathcal{S}$-graph shifts whose essential structure is encoded in a novel…

We investigate dynamical systems consisting of a locally compact Hausdorff space equipped with a partially defined local homeomorphism. Important examples of such systems include self-covering maps, one-sided shifts of finite type and, more…

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…