Related papers: Congruence lattices of finite diagram monoids

For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\_L on J(L). We establish a similar version of this…

In this technical report we describe a general class of monoids for which (sub)sequential rational can be characterised in terms of a congruence relation in the flavour of Myhill-Nerode relation. The class of monoids that we consider can be…

In this paper we characterize the monoid congruences of commutative semigroups by the help of the notion of the separator of subsets of semigroups. We show that every monoid congruence of a commutative semigroup S can be constructed by the…

In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated LCM lattices. In particular, we formally define the notion of coordinatizing a finite atomic lattice P to produce a monomial…

We obtain a presentation for the singular part of the Brauer monoid with respect to an irreducible system of generators, consisting of idempotents. As an application of this result we get a new construction of the symmetric group via…

Arithmetical congruence monoids, which arise in non-unique factorization theory, are multiplicative monoids $M_{a,b}$ consisting of all positive integers $n$ satsfying $n \equiv a \bmod b$. In this paper, we examine the asymptotic behavior…

Let $\mathcal W$ be a nontrivial variety of lattices, and let $L$ be a finite lattice in $\mathcal W$. The congruence density of $L$ with respect to $\mathcal W$ is the number of congruences of $L$ divided by the maximum number of…

By a 1997 result of R. Freese, an $n$-element lattice has at most $2^{n-1}$ congruences. This motivates us to define the congruence density cd$(L)$ of a finite $n$-element lattice as $|$Con$(L)|/2^{n-1}$, where $|$Con$(L)|$ is the number of…

We characterize the order of principal congruences of a bounded lattice as a bounded ordered set. We also state a number of open problems in this new field.

We prove two main results concerning mesoprimary decomposition of monoid congruences, as introduced by Kahle and Miller. First, we identify which associated prime congruences appear in every mesoprimary decomposition, thereby completing the…

In this work we consider monoids as algebras with an associative binary operation and the nullary operation that fixes the identity element. We found an example of two varieties of monoids with finite subvariety lattices such that their…

We consider the problem of covering $\mathbb{Z}^2$ with a finite number of sublattices of finite index, satisfying a simple minimality or non-degeneracy condition. We show how this problem may be viewed as a projective (or homogeneous)…

By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the…

This paper concerns a number of diagram categories, namely the partition, planar partition, Brauer, partial Brauer, Motzkin and Temperley-Lieb categories. If $\mathcal K$ denotes any of these categories, and if $\sigma\in\mathcal K_{nm}$ is…

The height of a poset $P$ is the supremum of the cardinalities of chains in $P$. The exact formula for the height of the subgroup lattice of the symmetric group $\mathcal{S}_n$ is known, as is an accurate asymptotic formula for the height…

Let $T_X$ be the full transformation monoid over a finite set $X$, and fix some $a\in T_X$ of rank $r$. The variant $T_X^a$ has underlying set $T_X$, and operation $f\star g=fag$. We study the congruences of the subsemigroup $P=Reg(T_X^a)$…

In this paper we study prime, maximal and two--class congruences from the point of view of the relationships between them in various kinds of universal algebras, as well as their direct and inverse images through morphisms. This research…

We define a class of monoidal categories whose morphisms are diagrams, and which are enhancements and generalisations of the Brauer category obtained by adjoining infinitesimal braids, "coupons" and poles. Properties of these categories are…

The cyclic shift graph of a monoid is the graph whose vertices are elements of the monoid and whose edges link elements that differ by a cyclic shift. For certain monoids connected with combinatorics, such as the plactic monoid (the monoid…

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…