Related papers: Refinement of Higher-Rank Graph Reduction

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 introduce $C^*$-algebras associated with directed graphs, along with two generalizations of this concept, namely Exel-Pardo $C^*$-algebras associated with a self-similar action of a group on a directed graph, and the $C^*$-algebras…

In this paper we extend and prove in detail the Finite Rank Theorem for connection matrices of graph parameters definable in Monadic Second Order Logic with counting (CMSOL) from B. Godlin, T. Kotek and J.A. Makowsky (2008) and J.A.…

The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…

We geometrically describe the relation induced on a set of graphs by isomorphism of their associated graph C*-algebras as the smallest equivalence relation generated by five types of moves. The graphs studied have finitely many vertices and…

We consider a free action of an Ore semigroup on a higher-rank graph, and the induced action by endomorphisms of the $C^*$-algebra of the graph. We show that the crossed product by this action is stably isomorphic to the $C^*$-algebra of a…

The primary purpose of this thesis is to show every ultragraph Leavitt path algebra is Morita equivalent, as a ring, to a graph Leavitt path algebra. Takeshi Katsura, Paul Muhly, Aidan Sims, and Mark Tomforde showed every ultragraph…

We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension,…

We consider groups defined by non-empty balanced presentations with the property that each relator is of the form R(x,y), where x and y are distinct generators and R(.,.) is determined by some fixed cyclically reduced word R(a,b) that…

This is the final one in the series of papers where we introduce and study the $C^*$-algebras associated with topological graphs. In this paper, we get a sufficient condition on topological graphs so that the associated $C^*$-algebras are…

We propose a categorification of the cyclotomic Hecke algebra in terms of the equivariant K-theory of the framed matrix factorizations. The construction generalizes the earlier construction of the authors for a categorification of the…

Using a homological invariant together with an obstruction class in a certain Ext^2-group, we may classify objects in triangulated categories that have projective resolutions of length two. This invariant gives strong classification results…

We define the categorical cohomology of a k-graph \Lambda\ and show that the first three terms in this cohomology are isomorphic to the corresponding terms in the cohomology defined in our previous paper. This leads to an alternative…

We classify the gauge-invariant ideals in the C*-algebras of infinite directed graphs, and describe the quotients as graph algebras. We then use these results to identify the gauge-invariant primitive ideals in terms of the structural…

An edge-girth-regular graph $egr(n,k,g,\lambda)$ is a $k-$regular graph of order $n$, girth $g$ and with the property that each of its edges is contained in exactly $\lambda$ distinct $g-$cycles. We present new families of edge-girth…

There is a graph reduction system so that every optimal 1-planar graph can be reduced to an irreducible extended wheel graph, provided the reductions are applied such that the given graph class is preserved. A graph is optimal 1-planar if…

The aim of this paper is to present a few versions of the Riemann-Hurwitz formula for a regular branched covering of graphs. By a graph, we mean a finite connected multigraph. The genus of a graph is defined as the rank of the first…

Exploiting the graph product structure and results concerning amalgamated free products of C*-algebras we provide an explicit computation of the K-theoretic invariants of right-angled Hecke C*-algebras, including concrete algebraic…

In math.QA/0506507 I. Gelfand and the authors introduced and studied a new class of algebras associated to directed graphs. In this paper we show that these algebras are Koszul for a large class of layered (i.e. ranked) graphs.

We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a…