Related papers: Graph morphisms as groupoid actors
In 1968, Erd\"os defined the Shift Graph as the graph whose vertices are the $k$-element subsets of $[n]=\{0,1,2,...,n-1\}$ such that $A=\{a_1,...,a_k\}$ and $B=\{b_1,...,b_k\}$ are neighbours iff $a_1<b_1=a_2<b_2=a_3<... <b_{n-1}=a_n<b_n$.…
We show that semigroup C*-algebras are groupoid C*-algebras.
We say that a graph $H$ dominates another graph $H'$ if the number of homomorphisms from $H'$ to any graph $G$ is dominated, in an appropriate sense, by the number of homomorphisms from $H$ to $G$. We study the family of dominating graphs,…
A graph operator is a function $\Gamma$ defined on some set of graphs such that whenever two graphs $G$ and $H$ are isomorphic, written $G\simeq H$, then $\Gamma(G)\simeq \Gamma(H)$. For a graph $G$ not in the domain of $\Gamma$, we put…
Bergman has given the following abstract characterisation of the inner automorphisms of a group $G$: they are exactly those automorphisms of $G$ which can be extended functorially along any homomorphism $G \rightarrow H$ to an automorphism…
We prove that unital graph C*-algebras often admit a convenient decomposition into amalgamated free products. We use this to give a complete characterization of when a unital graph C*-algebra is residually finite-dimensional and when it is…
Given an adaptable separated graph, we construct an associated groupoid and explore its type semigroup. Specifically, we first attach to each adaptable separated graph a corresponding semigroup, which we prove is an $E^*$-unitary inverse…
We characterise when the Leavitt path algebras over $\mathbb{Z}$ of two arbitrary countable directed graphs are $*$-isomorphic by showing that two Leavitt path algebras over $\mathbb{Z}$ are $*$-isomorphic if and only if the corresponding…
Events in natural videos typically arise from spatio-temporal interactions between actors and objects and involve multiple co-occurring activities and object classes. To capture this rich visual and semantic context, we propose using two…
Given a category, one may construct slices of it. That is, one builds a new category whose objects are the morphisms from the category with a fixed codomain and morphisms certain commutative triangles. If the category is a groupoid, so that…
In this paper, we introduce quotients of \'etale groupoids. Using the notion of quotients, we describe the abelianizations of groupoid C*-algebras. As another application, we obtain a simple proof that effectiveness of an \'etale groupoid…
For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…
We consider graphs E which have been obtained by adding one or more sinks to a fixed directed graph G. We classify the C*-algebra of E up to a very strong equivalence relation, which insists, loosely speaking, that C*(G) is kept fixed. The…
We give criteria for certain morphisms from an algebraic stack to a (not necessarily algebraic) stack to admit an (appropriately defined) scheme-theoretic image. We apply our criteria to show that certain natural moduli stacks of local…
In a recent paper, Pardo and the first named author introduced a class of C*-algebras which which are constructed from an action of a group on a graph. This class was shown to include many C*-algebras of interest, including all Kirchberg…
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…
A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…
The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…
We define hyperbolic groupoids, generalizing the notion of a Gromov hyperbolic group. Examples of hyperbolic groupoids include actions of Gromov hyperbolic groups on their boundaries, pseudogroups generated by expanding self-coverings,…
Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…