Related papers: Inverse monoids of partial graph automorphisms
We show how to construct a family of groups with simple commutator subgroups from aperiodic 1-vertex, finitely aligned higher rank graphs (which are, in fact, a class of cancellative monoids). Inverse semigroups form the intermediary…
A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…
Gain graphs are graphs where the edges are given some orientation and labeled with the elements (called gains) from a group so that gains are inverted when we reverse the direction of the edges. Generalizing the notion of gain graphs, skew…
We formulate a notion of the quantum automorphism group of a $2$-graph. After some preliminary computations, we define quantum isomorphism between a pair of $2$-graphs. We produce a `non-trivial' example of a pair of $2$-graphs that are not…
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…
The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…
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…
In their paper titled "On $F$-inverse covers of inverse monoids", Auinger and Szendrei have shown that every finite inverse monoid has an $F$-inverse cover if and only if each finite graph admits a locally finite group variety with a…
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More…
We give several characterisations of groupoids determined by involutive automorphisms on semilattices of groups.
It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…
An answer to the question investigated in this paper brings a new characterization of internal groupoids such that: (a) it holds even when finite limits are not assumed to exist; (b) it is a full subcategory of the category of…
Let $\Gamma$ be a finite graph and let $\Gamma^{\mathrm{e}}$ be its extension graph. We inductively define a sequence $\{\Gamma_i\}$ of finite induced subgraphs of $\Gamma^{\mathrm{e}}$ through successive applications of an operation called…
A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible…
We give an algebraic characterisation of ordered groupoids, namely, we show that there is a categorical isomophism between the category of ordered groupoids and the category of $D$-inverse constellations. Here constellations are partial…
In this paper, we initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe vertices such that the non-probe vertices form an independent…
We consider a version of the notion of F-inverse semigroup (studied in the algebraic theory of inverse semigroups). We point out that an action of such an inverse semigroup on a locally compact space has associated a natural groupoid…
Two of the natural topologies for infinite graphs with edge-ends are Etop and Itop. In this paper, we study and characterize them. We show that Itop can be constructed by inverse limits of inverse systems of graphs with finitely many…
We build on the description of left congruences on an inverse semigroup in terms of the kernel and trace due to Petrich and Rankin. The notion of an inverse kernel for a left congruence is developed. Various properties of both the trace and…
Finite-above inverse monoids are a common generalization of finite inverse monoids and Margolis--Meakin expansions of groups. Given a finite-above $E$-unitary inverse monoid $M$ and a group variety $\mathit{U}$, we find a condition for $M$…