scholarly journals Minimal representations of a finite distributive lattice by principal congruences of a lattice

2019 ◽  
Vol 85 (12) ◽  
pp. 69-96
Author(s):  
George Grätzer ◽  
Harry Lakser
1998 ◽  
Vol 41 (3) ◽  
pp. 290-297 ◽  
Author(s):  
G. Grätzer ◽  
H. Lakser ◽  
E. T. Schmidt

AbstractWe prove that every finite distributive lattice can be represented as the congruence lattice of a finite (planar) semimodular lattice.


10.37236/5980 ◽  
2016 ◽  
Vol 23 (4) ◽  
Author(s):  
Samuel Braunfeld

In Homogeneous permutations, Peter Cameron [Electronic Journal of Combinatorics 2002] classified the homogeneous permutations (homogeneous structures with 2 linear orders), and posed the problem of classifying the homogeneous $n$-dimensional permutation structures (homogeneous structures with $n$ linear orders) for all finite $n$. We prove here that the lattice of $\emptyset$-definable equivalence relations in such a structure can be any finite distributive lattice, providing many new imprimitive examples of homogeneous finite dimensional permutation structures. We conjecture that the distributivity of the lattice of $\emptyset$-definable equivalence relations is necessary, and prove this under the assumption that the reduct of the structure to the language of $\emptyset$-definable equivalence relations is homogeneous. Finally, we conjecture a classification of the primitive examples, and confirm this in the special case where all minimal forbidden structures have order 2. 


2020 ◽  
Vol 39 (3) ◽  
pp. 2831-2843
Author(s):  
Peng He ◽  
Xue-Ping Wang

Let D be a finite distributive lattice with n join-irreducible elements. It is well-known that D can be represented as the congruence lattice of a rectangular lattice L which is a special planer semimodular lattice. In this paper, we shall give a better upper bound for the size of L by a function of n, improving a 2009 result of G. Grätzer and E. Knapp.


1982 ◽  
Vol 15 (1) ◽  
pp. 258-271
Author(s):  
C. C. Chen ◽  
K. M. Koh ◽  
S. C. Lee

10.37236/5466 ◽  
2017 ◽  
Vol 24 (1) ◽  
Author(s):  
Joseph E. Bonin

For a presentation $\mathcal{A}$ of a transversal matroid $M$, we study the ordered set $T_{\mathcal{A}}$ of single-element transversal extensions of $M$ that have presentations that extend $\mathcal{A}$; extensions are ordered by the weak order.  We show that $T_{\mathcal{A}}$ is a distributive lattice, and that each finite distributive lattice is isomorphic to $T_{\mathcal{A}}$ for some presentation $\mathcal{A}$ of some transversal matroid $M$. We show that $T_{\mathcal{A}}\cap T_{\mathcal{B}}$, for any two presentations $\mathcal{A}$ and $\mathcal{B}$ of $M$, is a sublattice of both $T_{\mathcal{A}}$ and $T_{\mathcal{B}}$. We prove sharp upper bounds on $|T_{\mathcal{A}}|$ for presentations $\mathcal{A}$ of rank less than $r(M)$ in the order on presentations; we also give a sharp upper bound on $|T_{\mathcal{A}}\cap T_{\mathcal{B}}|$. The main tool we introduce to study $T_{\mathcal{A}}$ is the lattice $L_{\mathcal{A}}$ of closed sets of a certain closure operator on the lattice of subsets of $\{1,2,\ldots,r(M)\}$.


1986 ◽  
Vol 38 (5) ◽  
pp. 1122-1134 ◽  
Author(s):  
George Grätzer ◽  
Harry Lakser

Given a lattice L and a convex sublattice K of L, it is well-known that the map Con L → Con K from the congruence lattice of L to that of K determined by restriction is a lattice homomorphism preserving 0 and 1. It is a classical result (first discovered by R. P. Dilworth, unpublished, then by G. Grätzer and E. T. Schmidt [2], see also [1], Theorem II.3.17, p. 81) that any finite distributive lattice is isomorphic to the congruence lattice of some finite lattice. Although it has been conjectured that any algebraic distributive lattice is the congruence lattice of some lattice, this has not yet been proved in its full generality. The best result is in [4]. The conjecture is true for ideal lattices of lattices with 0; see also [3].


Sign in / Sign up

Export Citation Format

Share Document