Author: Semenova M.
Publisher: Springer Publishing Company
ISSN: 0002-5232
Source: Algebra and Logic, Vol.45, Iss.2, 2006-03, pp. : 124-133
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
V. B. Repnitskii showed that any lattice embeds in some subsemilattice lattice. In his proof, use was made of a result by D. Bredikhin and B. Schein, stating that any lattice embeds in the suborder lattice of a suitable partial order. We present a direct proof of Repnitskii’s result, which is independent of Bredikhin—Schein’s, giving the answer to a question posed by L. N. Shevrin and A. J. Ovsyannikov. We also show that a finite lattice is lower bounded iff it is isomorphic to the lattice of subsemilattices of a finite semilattice that are closed under a distributive quasiorder.
Related content
Lattices embeddable in subsemigroup lattices. II. Cancellative semigroups
By Semenova M.
Algebra and Logic, Vol. 45, Iss. 4, 2006-07 ,pp. :
On Lattices Embeddable into Subsemigroup Lattices. IV. Free Semigroups
Semigroup Forum, Vol. 74, Iss. 2, 2007-04 ,pp. :
Lattices That are Embeddable in Suborder Lattices
By Semenova M.
Algebra and Logic, Vol. 44, Iss. 4, 2005-07 ,pp. :
Tiling Lattices with Sublattices, I
By Feldman David Propp James Robins Sinai
Discrete & Computational Geometry, Vol. 46, Iss. 1, 2011-07 ,pp. :