Related papers: Monadic distributive lattices and monadic augmente…
Our main goal is to develop a representation for finite distributive nearlattices through certain ordered structures. This representation generalizes the well-known representation given by Birkhoff for finite distributive lattices through…
The Cambrian lattices, introduced in (Reading, 2006), generalize the Tamari lattice to any choice of Coxeter element in any finite Coxeter group. They are further generalized to the m-Cambrian lattices (Stump, Thomas, Williams, 2015).…
Using Sheaf duality theory of Comer for cylindric algebras, we give a representation theorem of of distributive bounded lattices expanded by modalities (functions distributing over joins) as the continuous sections of sheaves. Our…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
Meet-distributive lattices form an intriguing class of lattices, because they are precisely the lattices obtainable from a closure operator with the so-called anti-exchange property. Moreover, meet-distributive lattices are join…
We give an elementary characterization of those (abelian) semigroups $M$ that are direct limits of countable sequences of finite direct products of monoids of the form $C\cup\{0\}$ for monogenic groups $C$. This characterization involves…
A mixed lattice is a lattice-type structure consisting of a set with two partial orderings, and generalizing the notion of a lattice. Mixed lattice theory has previously been studied in various algebraic structures, such as groups and…
We connect Priestley duality for distributive lattices and its generalization to distributive meet-semilattices to Hofmann-Mislove-Stralka duality for semilattices. Among other things, this involves consideration of various morphisms…
For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…
In this paper we introduce the class of weak Heyting Brouwer algebras (WHB-algebras, for short). We extend the well known duality between distributive lattices and Priestley spaces, in order to exhibit a relational Priestley-like duality…
It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…
One-dimensional quasilattices are classified into mutual local-derivability (MLD) classes on the basis of geometrical and number-theoretical considerations. Most quasilattices are ternary, and there exist an infinite number of MLD classes.…
We construct a compactification $M^{\mu ss}$ of the Uhlenbeck-Donaldson type for the moduli space of slope stable framed bundles. This is a kind of a moduli space of slope semistable framed sheaves. We show that there exists a projective…
In this note we generalize the construction, due to Ghilardi, of the free Heyting algebra generated by a finite distributive lattice, to the case of arbitrary distributive lattices. Categorically, this provides an explicit construction of a…
Spacetimes obtained by dimensional reduction along lattices containing a lightlike direction can admit semigroup extensions of their isometry groups. We show by concrete examples that such a semigroup can exhibit a natural order, which in…
For a quantaloid $\mathcal{Q}$, considered as a bicategory, Walters introduced categories enriched in $\mathcal{Q}$. Here we extend the study of monad-quantale-enriched categories of the past fifteen years by introducing…
We are interested in investigating some definitions and assumptions stated in [4], in particular the notions of measurability and atomicity that the two authors used in order to give a representation for multiplicative linear functionals…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
The natural join and the inner union operations combine relations of a database. Tropashko and Spight realized that these two operations are themeet and join operations in a class of lattices, known by now as the relational lattices. They…
In a previous work, (dual)-$\mathfrak{m}$-Rickart lattices were studied. Now, in this paper, we introduce $\mathfrak{m}$-endoregular lattices as those lattices $\mathcal{L}$ such that $\mathfrak{m}$ is a regular monoid, where $\mathfrak{m}$…