相关论文: Special elements in lattices of semigroup varietie…
M.S. Rao recently investigated some sorts of special filters in distributive pseudocomplemented lattices. In our paper we extend this study to lattices which need neither be distributive nor pseudocomplemented. For this sake we define a…
We completely classify all standard elements in the lattice of all monoid varieties. In particular, we prove that an element of this lattice is standard if and only if it is neutral.
In this paper, nil extensions of some special type of ordered semigroups, such as, simple regular ordered semigroups, left simple and right regular ordered semigroup. Moreover, we have characterized complete semilattice decomposition of all…
We describe overcommutative varieties of semigroups whose lattice of overcommutative subvarieties satisfies a non-trivial identity or quasiidentity. These two properties turn out to be equivalent.
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 completely classify all varieties of aperiodic monoids with commuting idempotents whose subvariety lattice is distributive.
We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of…
Here we introduce and characterize a new class of le-modules $_{R}M$ where $R$ is a commutative ring with $1$ and $(M,+,\leqslant,e)$ is a lattice ordered semigroup with the greatest element $e$. Several notions are defined and uniqueness…
We completely determine all commutative epigroup varieties that are cancellable elements of the lattice EPI of all epigroup varieties. In particular, we verify that a commutative epigroup variety is a cancellable element of the lattice EPI…
We show that many important varieties and sets of varieties of semigroups may be defined by relatively simple and transparent first-order formulas in the lattice of all semigroup varieties.
In the current paper we study extremal semilattices with respect to their equational properties. In the class $\mathbf{S}_n$ of all semilattices of order $n$ we find semilattices which have maximal (minimal) number of consistent equations.…
We characterize supersolvable lattices in terms of a certain modular type relation. McNamara and Thomas earlier characterized this class of lattices as those graded lattices having a maximal chain that consists of left-modular elements. Our…
We introduce and study $\mu$-elements, that generalize a lattice-theoretic abstraction (namely, essential elements) of essential ideals of rings, essential submodules of modules, and dense subsets of topological spaces. Exploring several…
A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…
To work more accurately with elements of the semigroup of the Stone Cech compactification of the discrete semigroup of natural numbers N under multiplication. We divided these elements into ultrafilters which are on finite levels and…
We completely classify all varieties of aperiodic monoids with central idempotents whose subvariety lattice is distributive.
We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.
In this article we investigate the relations between three classes of lattices each extending the class of distributive lattices in a different way. In particular, we consider join-semidistributive, join-extremal and left-modular lattices,…
Finite (upper) nearlattices are essentially the same mathematical entities as finite semilattices, finite commutative idempotent semigroups, finite join-enriched meet semilattices, and chopped lattices. We prove that if an $n$-element…
An algorithm is presented for generating finite modular, semimodular, graded, and geometric lattices up to isomorphism. Isomorphic copies are avoided using a combination of the general-purpose graph-isomorphism tool nauty and some…