Related papers: From join-irreducibles to dimension theory for lat…
We introduce the dimension monoid of a lattice L, denoted by Dim L. The monoid Dim L is commutative and conical, the latter meaning that the sum of any two nonzero elements is nonzero. Furthermore, Dim L is given along with the dimension…
For a finite lattice L, let EL denote the reflexive and transitive closure of the join-dependency relation on L, defined on the set J(L) of all join-irreducible elements of L. We characterize the relations of the form EL, as follows:…
Join-distributive lattices are finite, meet-semidistributive, and semimodular lattices. They are the same as Dilworth's lattices in 1940, and many alternative definitions and equivalent concepts have been discovered or rediscovered since…
For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…
We prove the following result: Let K be a lattice, let D be a distributive lattice with zero, and let $\phi$: Con K $\to$ D be a {∨, 0}-homomorphism, where Conc K denotes the {∨, 0}-semilattice of all finitely generated…
A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…
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…
For a finite distributive lattice $D$, let us call $Q \subseteq D$ \emph{principal congruence representable}, if there is a finite lattice $L$ such that the congruence lattice of $L$ is isomorphic to $D$ and the principal congruences of $L$…
We give two sufficient conditions for the lattice Co(R^n,X) of relatively convex sets of n-dimensional real space R^n to be join-semidistributive, where X is a finite union of segments. We also prove that every finite lower bounded lattice…
Let S be a distributive {∨, 0}-semilattice. In a previous paper, the second author proved the following result: Suppose that S is a lattice. Let K be a lattice, let $\phi$: Con K $\to$ S be a {∨, 0}-homomorphism. Then $\phi$ is,…
We attach to each $\langle 0, \vee \rangle$-semilattice a graph $\boldsymbol{G}_{\boldsymbol{S}}$ whose vertices are join-irreducible elements of $\boldsymbol{S}$ and whose edges correspond to the reflexive dependency relation. We study…
A simple but elegant result of Rival states that every sublattice $L$ of a finite distributive lattice $\mathcal{P}$ can be constructed from $\mathcal{P}$ by removing a particular family $\mathcal{I}_L$ of its irreducible intervals.…
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…
We prove that if $e$ is a join-irreducible element of a semimodular lattice $L$ of finite length and $h<e$ in $L$ such that $e$ does not cover $h$, then $e$ can be "lowered" to a covering of $h$ by taking a length-preserving semimodular…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
We say that a (∨,0)-semilattice S is conditionally co-Brouwerian, if (1) for all nonempty subsets X and Y of S such that X $\leq$ Y (i.e., x $\leq$ y for all (x, y) $\in$ X x Y), there exists z $\in$ S such that X $\leq$ z $\leq$ Y,…
Dilworth's theorem. Every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice $L$. We want: Every finite distributive lattice $D$ can be represented as the congruence lattice of a nice finite…
Motivated by a recent paper of G. Gr\"atzer, a finite distributive lattice $D$ is said to be fully principal congruence representable if for every subset $Q$ of $D$ containing $0$, $1$, and the set $J(D)$ of nonzero join-irreducible…
For a given complete lattice L, we investigate whether L can be decomposed as a direct product of directly indecomposable lattices. We prove that this is the case if every element of L is a join of join-irreducible elements and dually, thus…
Following G.~Gr\"atzer and E.~Knapp, 2009, a planar semimodular lattice $L$ is \emph{rectangular}, if~the left boundary chain has exactly one doubly-irreducible element, $c_l$, and the right boundary chain has exactly one doubly-irreducible…