Related papers: Ultragraphs and shifts spaces over infinite alphab…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
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…
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 shift graph is defined on the space of infinite subsets of natural numbers by letting two sets be adjacent if one can be obtained from the other by removing its least element. We show that this graph is not a minimum among the graphs of…
We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…
In the present paper, exterior algebraic shifting and symmetric algebraic shifting of bipartite graphs and chordal graphs are studied. First, we will determine the symmetric algebraic shifted graph of complete bipartite graphs. It turns out…
Monographs are graph-like structures with directed edges of unlimited length that are freely adjacent to each other. The standard nodes are represented as edges of length zero. They can be drawn in a way consistent with standard graphs and…
In a series of three papers we develop an end space theory for digraphs. Here in the second paper we introduce the topological space $|D|$ formed by a digraph $D$ together with its ends and limit edges. We then characterise those digraphs…
We discuss strong shift equivalence, which has been used to characterize conjugacy of edge shifts, and its application to C*-algebras of graphs and Cuntz-Pimsner algebras.
The well-known characterization of two-ended groups says that every two-ended group can be split over finite subgroups which means it is isomorphic to either by a free product with amalgamation $A\ast_C B$ or an HNN-extension $\ast_{\phi}…
A one-sided shift of finite type $(X_A,\sigma_A)$ determines on the one hand a Cuntz-Krieger algebra $\mathcal{O}_A$ with a distinguished abelian subalgebra $\mathcal{D}_A$ and a certain completely positive map $\tau_A$ on $\mathcal{O}_A$.…
Inspired by a recent novel work of Good and Meddaugh, we establish fundamental connections between shadowing, finite order shifts, and ultrametric complete spaces. We develop a theory of shifts of finite type for infinite alphabets. We call…
For a large class of finite graphs $E$, we show that whenever $\alpha$ is a vertex-fixing quasi-free automorphism of the corresponding graph $C^*$-algebra $C^*(E)$ such that $\alpha({\mathcal D}_E) \neq{\mathcal D}_E$, where ${\mathcal…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…
In this work we characterize those shift spaces which can support a 1-block quasi-group operation and show the analogous of Kitchens result: any such shift is conjugated to a product of a full shift with a finite shift. Moreover, we prove…
We investigate how the metric dimension of infinite graphs change when we add edges to the graph. Our two main results: (1) there exists a growing sequence of graphs (under the subgraph relation, but without adding vertices) for which the…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…