Properties of congruences of twisted partition monoids and their lattices

Abstract

We build on the recent characterisation of congruences on the infinite twisted partition monoids Pn and their finite d-twisted homomorphic images Pn,d, and investigate their algebraic and order-theoretic properties. We prove that each congruence of Pn is (finitely) generated by at most 5n2 pairs, and we characterise the principal ones. We also prove that the congruence lattice Cong(Pn) is not modular (or distributive); it has no infinite ascending chains, but it does have infinite descending chains and infinite antichains. By way of contrast, the lattice Cong(Pn,d) is modular but still not distributive for d>0, while Cong(Pn,0) is distributive. We also calculate the number of congruences of Pn,d, showing that the array (|Cong(Pn,d)|)n,d≥ 0 has a rational generating function, and that for a fixed n or d, |Cong(Pn,d)| is a polynomial in d or n≥ 4, respectively.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…