On lattices embeddable into subsemigroup lattices. V. Trees

We prove that the class of finite lattices embeddable into the subsemilattice lattices of semilattices which are (n-ary) trees can be axiomatized by identities within the class of finite lattices, whence it forms a pseudovariety.     

Lattices embeddable in subsemigroup lattices. II. Cancellative semigroups

Repnitskii proved that any lattice embeds in a subsemigroup lattice of some commutative, cancellative, idempotent free semigroup with unique roots. In that proof, use is made of a result by Bredikhin and Schein stating that any lattice embeds in a suborder lattice of suitable partial order. Here, we present a direct proof of Repnitskii’s result which is independent of Bredikhin-Schein’s, thus giving the answer to the question posed by Shevrin and Ovsyannikov. Supported by INTAS grant No. 03-51-4110; RF Ministry of Education grant No. E02-1.0-32; Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-2112.2003.1; a grant from the Russian Science Support Foundation; SB RAS Young Researchers Support project No. 11. __________ Translated from Algebra i Logika, Vol. 45, No. 4, pp. 436–446, July–August, 2006.     

Lattices embeddable in subsemigroup lattices. I. Semilattices

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. Supported by INTAS grant No. 03-51-4110; RF Ministry of Education grant No. E02-1.0-32; Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-2112.2003.1; a grant from the Russian Science Support Foundation; SB RAS Young Researchers Support project No. 11. __________ Translated from Algebra i Logika, Vol. 45, No. 2, pp. 215–230, March–April, 2006.     

Varieties of semigroups with non-trivial identities on subsemigroup lattices

The present notice is devoted to the characterization up to the group case of varieties of semigroups whose subsemigroup lattices satisfy non-trivial identities. Received November 2, 1999; accepted in final form April 23, 2000.     

On finite lattices which are embeddable in subsemigroup lattices

Communicated by L. N. Shevrin     

On lattices embeddable into lattices of algebraic subsets

We prove that, for a Scott-continuous lattice L, the lattice Sp(L) of algebraic subsets of L has a meet-complete lattice embedding into the lattice of algebraic subsets of a bi-algebraic distributive lattice.     

No finite axiomatizations for posets embeddable into distributive lattices

Let m and n be cardinals with $3\le m,n\le \omega$. We show that the class of posets that can be embedded into a distributive lattice via a map preserving all existing meets and joins with cardinalities strictly less than m and n respectively cannot be finitely axiomatized.     

Notes on sectionally complemented lattices. III

Summary In a recent survey article, G. Grätzer and E. T. Schmidt raise the problem when is the ideal lattice of a sectionally complemented chopped lattice sectionally complemented. The only general result is a 1999 lemma of theirs, stating that if the finite chopped lattice is the union of two ideals that intersect in a two-element ideal U, then the ideal lattice of M is sectionally complemented. In this paper, we present examples showing that in many ways their result is optimal. A typical result is the following: For any finite sectionally complemented lattice U with more than two elements, there exists a finite sectionally complemented chopped lattice M that is (i) the union of two ideals intersecting in the ideal U; (ii) the ideal lattice of M is not sectionally complemented.     

Another lattice of varieties of completely regular semigroups

Completely regular semigroups S are taken here with the unary operation of inversion within the maximal subgroups of S. As such they form a variety 𝒞? whose lattice of subvarieties is denoted by ?(𝒞?). The relation on ?(𝒞?) which identifies two varieties if they contain the same bands is denoted by B^∧. The upper ends of B^∧-classes which are neither equal to 𝒞? nor contained in the variety 𝒞𝒮 of completely simple semigroups are generated by two countably infinite ascending chains called canonical varieties. In a previous publication, we constructed the sublattice Σ of ?(𝒞?) generated by 𝒞𝒮 and the first four canonical varieties. Here we extend Σ to the sublattice Ψ of ?(𝒞?) generated by 𝒞𝒮 and the first six canonical varieties. For each of the varieties in Ψ?Σ, we construct the ladder and a basis of its identities.     

Varieties of restriction semigroups and varieties of categories

The variety of restriction semigroups may be most simply described as that generated from inverse semigroups (S, ·, ^?1) by forgetting the inverse operation and retaining the two operations x⁺ = xx^?1 and x* = x^?1x. The subvariety B of strict restriction semigroups is that generated by the Brandt semigroups. At the top of its lattice of subvarieties are the two intervals [B₂, B₂M = B] and [B₀, B₀M]. Here, B₂ and B₀ are, respectively, generated by the five-element Brandt semigroup and that obtained by removing one of its nonidempotents. The other two varieties are their joins with the variety of all monoids. It is shown here that the interval [B₂, B] is isomorphic to the lattice of varieties of categories, as introduced by Tilson in a seminal paper on this topic. Important concepts, such as the local and global varieties associated with monoids, are readily identified under this isomorphism. Two of Tilson's major theorems have natural interpretations and application to the interval [B₂, B] and, with modification, to the interval [B₀, B₀M] that lies below it. Further exploration may lead to applications in the reverse direction.     

On topological Clifford semigroups embeddable into products of cones over topological groups

In this paper we give characterizations of topological Clifford semigroups which are embeddable into Tychonoff products of topological semilattices and cones over topological groups. Also we characterize topological Clifford semigroups which embed into compact topological Clifford semigroups.     

Inverse semigroups determined by their lattices of convex inverse subsemigroups I

Every inverse semigroup possesses a natural partial order and therefore convexity with respect to this order is of interest. We study the extent to which an inverse semigroup is determined by its lattice of convex inverse subsemigroups; that is, if the lattices of two inverse semigroups are isomorphic, how are the semigroups related? We solve this problem completely for semilattices and for inverse semigroups in general reduce it to the case where the lattice isomorphism induces an isomorphism between the semilattices of idempotents of the semigroups. For many inverse semigroups, such as the monogenic ones, this case is the only one that can occur. In Part II, a study of the reduced case enables us to prove that many inverse semigroups, such as the free ones, are strictly determined by their lattices of convex inverse subsemigroups, and to show that the answer obtained here for semilattices can be extended to a broad class of inverse semigroups, including all finite, aperiodic ones. Received September 24, 2002; accepted in final form December 15, 2002.     

Commutative idempotent residuated lattices

We investigate the variety of residuated lattices with a commutative and idempotent monoid reduct.     

Iterative separation in distributive congruence lattices

In [PLOŠČICA, M.: Separation in distributive congruence lattices, Algebra Universalis 49 (2003), 1–12] we defined separable sets in algebraic lattices and showed a close connection between the types of non-separable sets in congruence lattices of algebras in a finitely generated congruence distributive variety and the structure of subdirectly irreducible algebras in . Now we generalize these results using the concept of separable mappings (defined on some trees) and apply them to some lattice varieties. Supported by VEGA Grants 2/4134/24, 2/7141/27, and INTAS Grant 03-51-4110.     

Embedding the bicyclic semigroup into countably compact topological semigroups

We study algebraic and topological properties of topological semigroups containing a copy of the bicyclic semigroup C(p,q). We prove that a topological semigroup S with pseudocompact square contains no dense copy of C(p,q). On the other hand, we construct a (consistent) example of a pseudocompact (countably compact) Tychonoff semigroup containing a copy of C(p,q).     

On additive semigroups starting parts

We present geometrical arguments suggesting that the part of the segment {0,1,…,N−1} covered by the additive semigroup generated by (a,b,c) between 0 and the Frobenius number N(a,b,c) should exceed λ V for some constant λ (which might be 1/3 or even more).