Related papers: Degree 2 Transformation Semigroups as Continuous M…
To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path…
The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph.
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
We give a practical computer algebra implementation of the Covering Lemma for finite transformation semigroups. The lemma states that given a surjective relational morphism $(X,S)\twoheadrightarrow(Y,T)$, we can establish emulation by a…
A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…
We introduce a notion of quantum function, and develop a compositional framework for finite quantum set theory based on a 2-category of quantum sets and quantum functions. We use this framework to formulate a 2-categorical theory of quantum…
We investigate a semigroup construction related to the two-sided wreath product. It encompasses a range of known constructions and gives a slightly finer version of the decomposition in the Krohn-Rhodes Theorem, in which the three-element…
We study a one-parameter family of binomial-convolution operators acting on sequences. These operators form an additive semigroup with an explicit inverse, and they subsume iterated classical binomial transforms as a special case. We…
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
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 describe the commuting graph of a Rees matrix semigroup over a group and investigate its properties: diameter, clique number, girth, chromatic number and knit degree. The maximum size of a commutative subsemigroup of a Rees matrix…
A standard approach to reduce the complexity of very large networks is to group together sets of nodes into clusters according to some criterion which reflects certain structural properties of the network. Beyond the well-known modularity…
We present a new general theory of function-based hypergraph transformations on finite families of finite hypergraphs. A function-based hypergraph transformation formalises the action of structurally modifying hypergraphs from a family in a…
We give a unified approach to analysing, for each positive integer $s$, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally $s$-arc transitive graphs of diameter at least $s$. A graph…
Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…
In this paper, we consider topological semigroup actions on compact topological spaces. Under mild assumptions on the semigroup and the action, we construct a semi-direct product groupoid with a Haar system. We also show that it is…
We use a version of the Trotter-Kato approximation theorem for strongly continuous semigroups in order to study flows on growing networks. For that reason we use the abstract notion of direct limits in the sense of category theory.
In this monograph we lay the foundation for a theory of coarse groups and coarse actions. Coarse groups are group objects in the category of coarse spaces, and can be thought of as sets with operations that satisfy the group axioms "up to…
Graph Transformers, which incorporate self-attention and positional encoding, have recently emerged as a powerful architecture for various graph learning tasks. Despite their impressive performance, the complex non-convex interactions…