Even if a lattice L is not distributive, it is still possible that for particular elements x, y, z ∈ L it holds (x∨y) ∧z = (x∧z) ∨ (y ∧z). If this is the case, we say that the triple (x, y, z) is distributive. In this note we provide some sufficient conditions for the distributivity of a given triple
AbstractLet D(v) denote the maximum number of pairwise disjoint Steiner triple systems of order v. I...
AbstractWe prove that a variety of lattices is weakly Mal’tsev if and only if it is a variety of dis...
In this paper, we prove that the lattice of all closure operators of a complete Almost Distributive ...
Even if a lattice L is not distributive, it is still possible that for particular elements x, y, z ∈...
Using known facts we give a simple characterization of the distributivity of lattices of finite leng...
In the paper we investigate Birkhoff’s conditions (Bi) and (Bi*). We prove that a discrete lattice L...
AbstractThe main result of this paper gives a characterization of neutral elements in lattices by th...
summary:We obtain a simple construction for particular subclasses of several varieties of lattice ex...
Let T be a collection of 3-element subsets S of {1,…,n} with the property that if i<j<k and a<b<c ...
AbstractSeveral definitions of ‘ideal” for multilattices are considered, as are several definitions ...
summary:In this paper we obtain the forbidden configuration for 0-distributive lattices
Almost Distributive Lattices (ADL) are structures defined by Swamy and Rao [14] as a common abstract...
By a 1941 result of Whitman, the free lattice FL(3) = FL(x, y, z) includes a sublattice FL(ω) freely...
AbstractWe prove that if M is a modular lattice of finite length and D is a maximal distributive sub...
Abstract. In 1968, E. T. Schmidt introduced the M3[D] construction, an extension of the five-element...
AbstractLet D(v) denote the maximum number of pairwise disjoint Steiner triple systems of order v. I...
AbstractWe prove that a variety of lattices is weakly Mal’tsev if and only if it is a variety of dis...
In this paper, we prove that the lattice of all closure operators of a complete Almost Distributive ...
Even if a lattice L is not distributive, it is still possible that for particular elements x, y, z ∈...
Using known facts we give a simple characterization of the distributivity of lattices of finite leng...
In the paper we investigate Birkhoff’s conditions (Bi) and (Bi*). We prove that a discrete lattice L...
AbstractThe main result of this paper gives a characterization of neutral elements in lattices by th...
summary:We obtain a simple construction for particular subclasses of several varieties of lattice ex...
Let T be a collection of 3-element subsets S of {1,…,n} with the property that if i<j<k and a<b<c ...
AbstractSeveral definitions of ‘ideal” for multilattices are considered, as are several definitions ...
summary:In this paper we obtain the forbidden configuration for 0-distributive lattices
Almost Distributive Lattices (ADL) are structures defined by Swamy and Rao [14] as a common abstract...
By a 1941 result of Whitman, the free lattice FL(3) = FL(x, y, z) includes a sublattice FL(ω) freely...
AbstractWe prove that if M is a modular lattice of finite length and D is a maximal distributive sub...
Abstract. In 1968, E. T. Schmidt introduced the M3[D] construction, an extension of the five-element...
AbstractLet D(v) denote the maximum number of pairwise disjoint Steiner triple systems of order v. I...
AbstractWe prove that a variety of lattices is weakly Mal’tsev if and only if it is a variety of dis...
In this paper, we prove that the lattice of all closure operators of a complete Almost Distributive ...
DOI
Add to ORKG