Related papers: Graph morphisms as groupoid actors

We study and classify a class of representations (called generalized geometric representations) of a Coxeter group of finite rank. These representations can be viewed as a natural generalization of the geometric representation. The…

We study P-groupoids that arise from certain decompositions of complete graphs. We show that left distributive P-groupoids are distributive, quasigroups. We characterize P-groupoids when the corresponding decomposition is a Hamiltonian…

We extend the notion of algebraic stack to an arbitrary subcanonical site C. If the topology on C is local on the target and satisfies descent for morphisms, we show that algebraic stacks are precisely those which are weakly equivalent to…

Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…

Let $R$ be a commutative ring with identity. We define a graph $\Gamma_{\aut}(R)$ on $ R$, with vertices elements of $R$, such that any two distinct vertices $x, y$ are adjacent if and only if there exists $\sigma \in \aut$ such that…

In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…

Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…

We initiate the study of C*-algebras and groupoids arising from left regular representations of Garside categories, a notion which originated from the study of Braid groups. Every higher rank graph is a Garside category in a natural way. We…

We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…

Let $G$ be a group. We define the coprime graph of subgroups of $G$, denoted by $\mathcal P(G)$, is a graph whose vertex set is the set of all proper subgroups of $G$, and two distinct vertices are adjacent if and only if the order of the…

We give a geometric description of a certain class of epimorphisms between complex reflection groups. We classify these epimorphisms, which can be interpreted as ``morphisms'' between the diagrams symbolizing standard presentations by…

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

It is a well-known fact that endomorphisms of $B(H)$ are intimately connected with families of mutually orthogonal isometries, i.e. with representations of the so-called Toeplitz $C^*$-algebras. In this paper we consider a natural…

I show how to associate a Clifford algebra to a graph. I describe the structure of these Clifford graph algebras and provide many examples and pictures. I describe which graphs correspond to isomorphic Clifford algebras and also discuss…

In this note, we define a new graph $\Gamma_d(G)$ on a finite group $G$, where $d$ is a divisor of $|G|$. The vertices of $\Gamma_d(G)$ are the subgroups of $G$ of order $d$ and two subgroups $H_1$ and $H_2$ of $G$ are said to be adjacent…

This dissertation concerns the classification of groupoid and higher-rank graph C*-algebras and has two main components. Firstly, for a groupoid it is shown that the notions of strength of convergence in the orbit space and…

We present groupoid morphisms as an algebraic structure for nonautonomous dynamics, as well as a generalization of group morphisms, which describe classic dynamical systems. We introduce the structure of cotranslations, as a specific kind…

An automorphism of a graph $G=(V,E)$ is a bijective map $\phi$ from $V$ to itself such that $\phi(v_i)\phi(v_j)\in E$ $\Leftrightarrow$ $v_i v_j\in E$ for any two vertices $v_i$ and $v_j$. Denote by $\mathfrak{G}$ the group consisting of…

A simple observation, showing that every groupoid becomes an inverse semigroup after adding one element. In such inverse semigroups all idempotents are mutually orthogonal. This fact implies that every C*-algebra of a discrete groupoid is a…

We argue that Transformers are essentially graph-to-graph models, with sequences just being a special case. Attention weights are functionally equivalent to graph edges. Our Graph-to-Graph Transformer architecture makes this ability…