Related papers: Periodic 2-graphs arising from subshifts
Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…
We develop a theory of graph C*-algebras using path groupoids and inverse semigroups. Row finiteness is not assumed so that the theory applies to graphs for which there are vertices emitting a countably infinite set of edges. We show that…
This paper is a continuation of the paper entitled "Subshifts, $\lambda$-graph bisystems and $C^*$-algebras", arXiv:1904.06464. A $\lambda$-graph bisystem consists of a pair of two labeled Bratteli diagrams satisfying certain compatibility…
We address the classification problem for graph $C^*$-algebras of finite graphs (finitely many edges and vertices), containing the class of Cuntz-Krieger algebras as a prominent special case. Contrasting earlier work, we do not assume that…
A pair $(A,B)$ of square $(0,1)$-matrices is called a \emph{Lehman pair} if $AB^T=J+kI$ for some integer $k\in\{-1,1,2,3,\ldots\}$. In this case $A$ and $B$ are called \emph{Lehman matrices}. This terminology arises because Lehman showed…
A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…
It is now well known that a simple graph $C^*$-algebra $C^*(E)$ of a directed graph $E$ is either AF or purely infinite. In this paper, we address the question of whether this is the case for labeled graph $C^*$-algebras recently introduced…
The higher rank graphs of Kumjian and Pask are discrete Conduche fibrations over the monoid of k-tuples of natural numbers for some k in which every morphism in the base has a finite preimage under the the fibration. We examine the…
We generalize a recent construction of Exel and Pardo, from discrete groups acting on finite directed graphs to locally compact groups acting on topological graphs. To each cocycle for such an action, we construct a $C^*$-correspondence…
Bandelt and Mulder's structural characterization of Bipartite Distance Hereditary graphs asserts that such graphs can be built inductively starting from a single vertex and by repeatedly adding either pending vertices or twins (i.e.,…
We provide inverse semigroup and groupoid models for the Toeplitz and Cuntz-Krieger algebras of finitely aligned higher-rank graphs. Using these models, we prove a uniqueness theorem for the Cuntz-Krieger algebra.
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
Two graphs $G$ and $H$ are \emph{cospectral} if the adjacency matrices share the same spectrum. Constructing cospectral non-isomorphic graphs has been studied extensively for many years and various constructions are known in the literature,…
\begin{abstract} In this paper, we investigate a shift arising from graph $G$. We prove that any $k$-dimensional shift of finite type can be generated through a $k$-dimensional graph. We investigate the structure of the shift space using…
Topological quivers are generalizations of directed graphs in which the sets of vertices and edges are locally compact Hausdorff spaces. Associated to such a topological quiver Q is a C*-correspondence, and from this correspondence one may…
We construct compact polyhedra with triangular faces whose links are generalized 3-gons. They are interesting compact spaces covered by Euclidean buildings of type $A_2$. Those spaces give us two-dimensional subshifts, which can be used to…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes…
We consider the boundary-path groupoids of topological higher-rank graphs. We show that the all such groupoids are topologically amenable. We deduce that the C*-algebras of topological higher-rank graphs are nuclear and prove versions of…
We present a version of the domino shuffling algorithm (due to Elkies, Kuperberg, Larsen and Propp) which works on a different lattice: the hexagonal lattice superimposed on its dual graph. We use our algorithm to count perfect matchings on…