The study of congruence relations is acknowledged as fundamental to the study of algebras. Inverse semigroups are a widely studied class for which congruences are well understood. We study one sided congruences on inverse semigroups. We develop the notion of an inverse kernel and show that a left congruence is determined by its trace and inverse kernel. Our strategy identifies the lattice of left congruences as a subset of the direct product of the lattice of congruences on the idempotents and the lattice of full inverse subsemigroups. This is a natural way to describe one sided congruences with many desirable properties, including that a pair is the inverse kernel and trace of a left congruence precisely when it is the inverse kernel and ...
We present an approach to construct order relations on semigroups via inverses along elements and su...
Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a sem...
A semigroup S is called inverse if for each s in S, there exists a unique t in S such that sts = s a...
Funding: This project forms part of the work toward my PhD at the University of York, supported by E...
Congruences on inverse semigroups via the (kernel-trace) method introduced by Scheiblich in 1974. In...
Much work has been done on the ℓ¹-algebras of groups, but much less on ℓ¹-algebras of semigroups. Th...
AbstractLet τ be a congruence on a full regular subsemigroup R of a regular semigroup S. The least c...
The theory of inverse semigroups forms a major part of semigroup theory. This theory has deep connec...
The theory of inverse semigroups forms a major part of semigroup theory. This theory has deep connec...
AbstractWe generalize the character formulas for multiplicities of irreducible constituents from gro...
The index of a subgroup of a group counts the number of cosets of that subgroup. A subgroup of fini...
[Almost] factorizable inverse monoids [semigroups] play an impor-tant rule in the theory of inverse ...
From any directed graph $E$ one can construct the graph inverse semigroup $G(E)$, whose elements, ro...
As an appropriate generalisation of the features of the classical (Schein) theory of representations...
I consider the problem of elaborating an analogue, for the dual symmetric inverse monoid, of the `cl...
We present an approach to construct order relations on semigroups via inverses along elements and su...
Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a sem...
A semigroup S is called inverse if for each s in S, there exists a unique t in S such that sts = s a...
Funding: This project forms part of the work toward my PhD at the University of York, supported by E...
Congruences on inverse semigroups via the (kernel-trace) method introduced by Scheiblich in 1974. In...
Much work has been done on the ℓ¹-algebras of groups, but much less on ℓ¹-algebras of semigroups. Th...
AbstractLet τ be a congruence on a full regular subsemigroup R of a regular semigroup S. The least c...
The theory of inverse semigroups forms a major part of semigroup theory. This theory has deep connec...
The theory of inverse semigroups forms a major part of semigroup theory. This theory has deep connec...
AbstractWe generalize the character formulas for multiplicities of irreducible constituents from gro...
The index of a subgroup of a group counts the number of cosets of that subgroup. A subgroup of fini...
[Almost] factorizable inverse monoids [semigroups] play an impor-tant rule in the theory of inverse ...
From any directed graph $E$ one can construct the graph inverse semigroup $G(E)$, whose elements, ro...
As an appropriate generalisation of the features of the classical (Schein) theory of representations...
I consider the problem of elaborating an analogue, for the dual symmetric inverse monoid, of the `cl...
We present an approach to construct order relations on semigroups via inverses along elements and su...
Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a sem...
A semigroup S is called inverse if for each s in S, there exists a unique t in S such that sts = s a...