Related papers: On Lambda-Graph Systems for Subshifts of Subshifts

$\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 notions of symbolic matrix system and $\lambda$-graph system for a subshift are generalizations of symbolic matrix and $\lambda$-graph (= finite symbolic matrix) for a sofic shift respectively ([Doc. Math. 4(1999), 285-340]). M. Nasu…

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…

Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…

We will study a certain synchronizing property of subshifts called $\lambda$-synchronization. The $\lambda$-synchronizing subshifts form a large class of irreducible subshifts containing irreducible sofic shifts. We prove that the…

Given $r \geq 3$, we prove that there exists $\lambda >0$ depending only on $r$ so that if $G$ is a metric graph of rank $r$ with metric entropy $1$, then there exists a proper subgraph $H$ of $G$ with metric entropy at least $\lambda$.…

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…

This note extends and strengthens a theorem of Bates that says that row-finite graphs that are strong shift equivalent have Morita equivalent graph C*-algebras. This allows us to ask whether our stronger notion of Morita equivalence does in…

In this book authors for the first time introduce the notion of strong neutrosophic graphs. They are very different from the usual graphs and neutrosophic graphs. Using these new structures special subgraph topological spaces are defined.…

$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 show that for a sofic shift Lambda, Matsumoto's C*-algebra O_Lambda is isomorphic to the Cuntz-Krieger algebra of the left Krieger cover graph of Lambda.

For every finite-to-one map $\lambda:\Gamma\to\Gamma$ and for every abelian group $K$, the generalized shift $\sigma_\lambda$ of the direct sum $\bigoplus_\Gamma K$ is the endomorphism defined by…

A vertex $v$ of a 2-connected cubic graph $G$ is $\lambda$-matchable if $G$ has a spanning subgraph in which $v$ has degree three whereas every other vertex has degree one, and we let $\lambda(G)$ denote the number of such vertices.…

For graph classification tasks, many traditional kernel methods focus on measuring the similarity between graphs. These methods have achieved great success on resolving graph isomorphism problems. However, in some classification problems,…

Based on our previous graph covering method, we introduce weighted graph covering models and flexible graph covering models that are almost equivalent to the well-known Bratteli--Vershik models. These models play important roles in showing…

Quantifying the complexity of large graphs requires measures that extend beyond predefined structural features and scale efficiently with graph size. This work adopts a generative perspective, modeling large networks as exchangeable graphs…

We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…

To any periodic, unital and full C*-dynamical system (A, \alpha, R) an invertible operator s acting on the Banach space of trace functionals of the fixed point algebra is canonically associated. KMS states correspond to positive…

We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise…

We introduce the concept of a 1-coaligned $k$-graph and prove that the shift maps of a $k$-graph pairwise *-commute if and only if the $k$-graph is 1-coaligned. We then prove that for 2-graphs $\Lambda$ generated from basic data *-commuting…