Two embedding theorems for lower bounded lattices
A finite lattice \(L\) is lower bounded if, for every homomorphism from a finitely generated free lattice into \(L,\) the preimage of an element of \(L\) has a smallest element whenever it is non-empty. Main results: Theorem 1. Every finite lower bounded lattice \(L\) can be embedded in a finite atomistic lower bounded lattice \(L_1\) with \(\big | J(L_1)\big | =\big | J(L)\big | .\) Theorem 2. A finite lattice \(L\) is lower bounded iff \(L\) can be embedded in the lattice \(\text{Sub}(P)\) of all subsemilattices of some finite semilattice \(P.\)
- Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
- On lattices embeddable into lattices of algebraic subsets
- The lattice of embedded subsets
- Embedding $ p$-elementary lattices
- On lattice embeddings of a lattice into its intervals
- Embedding theory of lattices and its application for $2$-integrable lattices
- On two imbedding theorems
- Two embedding theorems
- Two embedding theorems
- Embedding lattices in \(L^2([0,1], \mathbb Z)\)
- On finite lattices which are embeddable in subsemigroup lattices
- Embedding finite lattices into finite biatomic lattices
- Every lattice with 1 and 0 is embeddable in the lattice of topologies of some set by an embedding which preserves the 1 and 0
- Open questions related to the problem of Birkhoff and Maltsev
- On lower bounded lattices.
- Join-semidistributive lattices and convex geometries.
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Sublattices of lattices of order-convex sets. I: The main representation theorem
- On the representation of lattices by subsemigroup lattices of bands
- Optimum basis of finite convex geometry
- Representing finite convex geometries by relatively convex sets
- Reflections on lower bounded lattices
- Surmise relations between tests -- preliminary results of the mathematical modeling
- Lattices of regular closed subsets of closure spaces
- A lower bound for rank 2 lattice rules
- On the prevariety of perfect lattices
This page was built for publication: Two embedding theorems for lower bounded lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1272234)
