Related papers: Planar, infinite, semidistributive lattices
A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…
In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…
This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…
We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to…
We present a procedure to enumerate the whole set of numerical semigroups with a given Frobenius number F, S(F). The methodology is based on the construction of a partition of S(F) by a congruence relation. We identify exactly one…
We adopt a new perspective on the tensor product of arbitrary semi-lattices. Our basic construction exploits a description of semi-lattices in terms of bi-extensional Chu spaces associated to a target space defined to be the boolean domain.…
A (v,0)-semilattice is ultraboolean, if it is a directed union of finite Boolean (v,0)-semilattices. We prove that every distributive (v,0)-semilattice is a retract of some ultraboolean (v,0)-semilattices. This is established by proving…
We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…
The purpose of this article is to investigate the combinatorial properties of the cross section lattice of a $J$-irreducible monoid associated with a semisimple algebraic group of one of the types $A_n$, $B_n$, or $C_n$. Our main tool is a…
Associated with any composition beta=(a,b,...) is a corresponding fence poset F(beta) whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... The distributive lattice L(beta) of all lower order…
We consider two constructions of an envelope for a finite locally distributive strong upper semilattice. The first is based on Birkhoff's representation of finite distributive lattices and the second on valuations on lattices. We show that…
Given a group $G$ and a subgroup $H$, we let $\mathcal{O}_G(H)$ denote the lattice of subgroups of $G$ containing $H$. This paper provides a classification of the subgroups $H$ of $G$ such that $\mathcal{O}_{G}(H)$ is Boolean of rank at…
This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…
In this paper we introduce the localization construction for quantales. A quantale is a complete semilattice combined with a multiplication. We mimic the notion of filter in a lattice to define multiplicative filters in a quantale, and…
This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…
The Congruence Lattice Problem (CLP), stated by R. P. Dilworth in the forties, asks whether every distributive {∨, 0}-semilatticeS is isomorphic to the semilattice Conc L of compact congruences of a lattice L. While this problem is…
Birkhoff's representation theorem (Birkhoff, 1937) defines a bijection between elements of a distributive lattice and the family of upper sets of an associated poset. Although not used explicitly, this result is at the backbone of the…
We characterize when a finite lattice is distributive by the existences of some particular classes of Koszul filtrations.
A planar (upper) semimodular lattice $L$ is slim if the five-element nondistributive modular lattice $M_3$ does not occur among its sublattices. (Planar lattices are finite by definition.) Slim rectangular lattices as particular slim planar…