Related papers: Counting of lattices containing up to four compara…
In 2020 Bhavale and Waphare introduced the concept of a nullity of a poset as nullity of its cover graph. In 2003 Pawar and Waphare counted all non-isomorphic lattices on n elements and n edges, which are precisely lattices of nullity one.…
In 2002 Thakare et al.\ counted non-isomorphic lattices on $n$ elements, having nullity up to two. In 2020 Bhavale and Waphare introduced the concept of RC-lattices as the class of all lattices in which all the reducible elements are…
In this paper, we count all non-isomorphic lattices on $n$ elements, containing four reducible elements and having nullity three. This work is in respect of Birkhoff's open problem (which is NP-complete) of counting all finite lattices on…
In $1941$ Dushnik and Miller introduced the concept of dimension of a poset. In $2020$ Bhavale and Waphare introduced the concept of an RC-lattice as a lattice in which all the reducible elements are lying on a chain. In this paper, we…
A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…
In this article we introduce the study of the number of pairs of non-comparable elements in a distributive lattice $\L$. We give several tight lower and upper bounds for the number and give as an application the lattices precisely for which…
Given k sets such that no one is contained in another, there is an associated lattice on the power set P([k]) corresponding to inclusion relations among unions of the sets. Two lattices on P([k]) are equivalent if there is a permutation of…
For a positive integer $s$, a lattice $L$ is said to be $s$-integrable if $\sqrt{s}\cdot L$ is isometric to a sublattice of $\mathbb{Z}^n$ for some integer $n$. Conway and Sloane found two minimal non $2$-integrable lattices of rank $12$…
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…
Unitally nondistributive quantales are unital quantales such that the unit is approximable by the totally below relation and does not meet-distribute over arbitrary joins. It is shown that the underlying nondistributive complete lattice…
It is well-known that relatively pseudocomplemented lattices can serve as an algebraic semantics of intuitionistic logic. To extend the concept of relative pseudocomplementation to non-distributive lattices, the first author introduced…
Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes all distributive lattices. Heitzig and Reinhold developed an algorithm to enumerate, up to isomorphism, all finite lattices up to size 18.…
A distributive lattice $L$ with minimum element $0$ is called decomposable if $a$ and $b$ are not comparable elements in $L$ then there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…
The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…
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…
Lattices are simplified by removing some of their doubly irreducible elements, resulting in smaller lattices called racks. All vertically indecomposable modular racks of $n \le 40$ elements are listed, and the numbers of all modular…
A planar (upper) semimodular lattice $L$ is slim if the five-element nondistributive modular lattice $M_3$ does not occur among its sublattices. (Planar lattices are finite by definition.) Slim rectangular lattices as particular slim planar…
In this paper, we continue our study of the zero-divisor graphs of lower dismantlable lattices that was started in [20]. The present paper mainly deals with an Isomorphism Problem for the zero-divisor graphs of lattices. In fact, we prove…
A periodic lattice in Euclidean 3-space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
Nullnorms with a zero element being at any point of a bounded lattice are an important generalization of triangular norms and triangular conorms. This paper obtains an equivalent characterization for the existence of idempotent nullnorms…