Related papers: Inverse monoids of partial graph automorphisms
We investigate the concept of definable, or inner, automorphism in the logical setting of partial Horn theories. The central technical result extends a syntactical characterization of the group of such automorphisms (called the covariant…
In this paper, we characterize the monoid of endomorphisms of the semigroup of all monotone full transformations of a finite chain, as well as the monoids of endomorphisms of the semigroup of all monotone partial transformations and of the…
In this paper we study submonoids of the monoid $\mathscr{I}_\infty^{\,\Rsh\!\!\!\nearrow}(\mathbb{N})$ of almost monotone injective co-finite partial selfmaps of positive integers $\mathbb{N}$. Let…
We describe the structure of finite Boolean inverse monoids and apply our results to the representation theory of finite inverse semigroups. We then generalize to semisimple Boolean inverse semigroups.
The automorphisms of a graph act naturally on its set of labeled imbeddings to produce its unlabeled imbeddings. The imbedding sum of a graph is a polynomial that contains useful information about a graph's labeled and unlabeled imbeddings.…
We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…
As part of his study of representations of the polycylic monoids, M.V. Lawson described all the closed inverse submonoids of a polycyclic monoid $P_n$ and classified them up to conjugacy. We show that Lawson's description can be extended to…
Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to…
We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…
Every $F$-inverse monoid can be equipped with the unary operation which maps each element to the maximum element of its $\sigma$-class. In this enriched signature, the class of all $F$-inverse monoids forms a variety of algebraic…
In this paper we investigate locally compact semitopological graph inverse semigroups. Our main result is the following: if a directed graph $E$ is strongly connected and contains a finite amount of vertices then a locally compact…
We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…
We define a class of inverse monoids having the property that their lattices of principal ideals naturally form an MV-algebra. We say that an arbitrary MV-algebra can be co-ordinatized if it is isomorphic to one constructed in this way from…
We associate each endomorphism of a finite cyclic group with a digraph and study many properties of this digraph, including its adjacent matrix and automorphism group.
The dual symmetric inverse monoid $\mathscr{I}_n^*$ is the inverse monoid of all isomorphisms between quotients of an $n$-set. We give a monoid presentation of $\mathscr{I}_n^*$ and, along the way, establish criteria for a monoid to be…
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…
We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…
For any abstract subfactor planar algebra $P$, there exists a finite index extremal subfactor $M_0 \subset M_1$ with $P$ as its standard invariant. In this paper, we classify the automorphism group of a bipartite graph planar algebra, and…
In this paper, we investigate the connection between infinite permutation monoids and bimorphism monoids of first-order structures. Taking our lead from the study of automorphism groups of structures as infinite permutation groups and the…
The index of a subgroup of a group counts the number of cosets of that subgroup. A subgroup of finite index often shares structural properties with the group, and the existence of a subgroup of finite index with some particular property can…