Related papers: A Distributive Lattice Cover for Semilattices

In a 1998 paper with H. Lakser, the authors proved that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite \emph{semimodular lattice}. Some ten years later, the first author and E. Knapp proved a…

We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of…

We characterize the finite intervals of the Muchnik lattice by proving that they are a certain proper subclass of the finite distributive lattices.

We provide a characterization of upper locally distributive lattices (ULD-lattices) in terms of edge colorings of their cover graphs. In many instances where a set of combinatorial objects carries the order structure of a lattice this…

For a finite lattice $\Lambda$, $\Lambda$-ultrametric spaces have, among other reasons, appeared as a means of constructing structures with lattices of equivalence relations embedding $\Lambda$. This makes use of an isomorphism of…

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…

Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…

In this article, we prove that finite semidistributive lattices are dismantlable if and only if they are planar. This extends a well-known result by Kelly and Rival that states the same property for finite distributive lattices. Moreover,…

For a modular lattice $L$ of finite length, we prove that the distributivity of $L$ is a sufficient condition while its 2-distributivity is a necessary condition that those sublattices of $L$ that are closed under taking relative…

In this paper subvarieties of pseudocomplemented distributive lattices are classified by their unification type. We determine the unification type of every particular unification problem in each subvariety of pseudocomplemented distributive…

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…

A discrete subgroup $\Gamma$ of a locally compact group $H$ is called a uniform lattice if the quotient $H/\Gamma$ is compact. Such an $H$ is called an envelope of $\Gamma$. In this paper we study the problem of classifying envelopes of…

I present here another example of a lattice fibration, a discrete version of the highest dimensional Hopf fibration: $S^{7}\longrightarrow S^{15} \longrightarrow S^{8}$.

We devise exact conditions under which a join semilattice with a weak contact relation can be semilattice embedded into a Boolean algebra with an overlap contact relation, equivalently, into a distributive lattice with additive contact…

We prove a Fundamental Theorem of Finite Semidistributive Lattices (FTFSDL), modelled on Birkhoff's Fundamental Theorem of Finite Distributive Lattices. Our FTFSDL is of the form "A poset L is a finite semidistributive lattice if and only…

We characterize when a finite lattice is distributive by the existences of some particular classes of Koszul filtrations.

We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…

The aim of this work is to prove inverse formulas for Laplace transform on semilattices of open-and-compact sets in a both discrete and non-discrete cases. These are partial answers to a question posed by Yu.~I.~Lyubich.

We discuss the relationship between tight and cover-to-join representations of semilattices and inverse semigroups, showing that a slight extension of the former, together with an appropriate selection of co-domains, makes the two notions…

In this paper, we provide an alternative description of the duality result for distributive lattices and coherent locales using ultraposet. In particular, we show that there are fully faithful embeddings from the opposite of the category of…