Funding: The first author is supported by ARC Future Fellowship FT190100632. The second author is supported by EPSRC grant EP/S020616/1.We give a complete description of the congruences on the partition monoid PX and the partial Brauer monoid PBX, where X is an arbitrary infinite set, and also of the lattices formed by all such congruences. Our results complement those from a recent article of East, Mitchell, Ruškuc and Torpey, which deals with the finite case. As a consequence of our classification result, we show that the congruence lattices of PX and PBX are isomorphic to each other, and are distributive and well quasi-ordered. We also calculate the smallest number of pairs of partitions required to generate any congruence; when this num...
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ...
We give a characterisation of the idempotents of the partition monoid, and use this to enumerate the...
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for ...
We give a complete description of the congruence lattices of the following finite diagram monoids: t...
We build on the recent characterisation of congruences on the infinite twisted partition monoids PΦn...
The twisted partition monoid PΦn is an infinite monoid obtained from the classical finite partition ...
Let X and X be the partition monoid and symmetric group on an infinite set X. We show that X may be ...
We study monoids generated by various combinations of idempotents and one- or two-sided units of an ...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
AbstractLet L be a bounded lattice, let [a,b] and [c,d] be intervals of L, and let ϕ:[a,b]→[c,d] be ...
In this paper, we define the partition function pedj;kðnÞ; the number of [j, k]-partitions of n into...
AbstractIn Part I of this paper, we introduced a method of making two isomorphic intervals of a boun...
We prove that an infinite (bounded) involution lattice and even pseudo-Kleene algebra can have any n...
We investigate the manner in which the partition monoid Pn and algebra Pξ n may be presented by gene...
We investigate the structure of the twisted Brauer monoid (Figure presented.), comparing and contras...
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ...
We give a characterisation of the idempotents of the partition monoid, and use this to enumerate the...
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for ...
We give a complete description of the congruence lattices of the following finite diagram monoids: t...
We build on the recent characterisation of congruences on the infinite twisted partition monoids PΦn...
The twisted partition monoid PΦn is an infinite monoid obtained from the classical finite partition ...
Let X and X be the partition monoid and symmetric group on an infinite set X. We show that X may be ...
We study monoids generated by various combinations of idempotents and one- or two-sided units of an ...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
AbstractLet L be a bounded lattice, let [a,b] and [c,d] be intervals of L, and let ϕ:[a,b]→[c,d] be ...
In this paper, we define the partition function pedj;kðnÞ; the number of [j, k]-partitions of n into...
AbstractIn Part I of this paper, we introduced a method of making two isomorphic intervals of a boun...
We prove that an infinite (bounded) involution lattice and even pseudo-Kleene algebra can have any n...
We investigate the manner in which the partition monoid Pn and algebra Pξ n may be presented by gene...
We investigate the structure of the twisted Brauer monoid (Figure presented.), comparing and contras...
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ...
We give a characterisation of the idempotents of the partition monoid, and use this to enumerate the...
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for ...