Authors: V D Shmatkov
Publish Date: 2016/01/19
Volume: 213, Issue: 2, Pages: 276-280
Abstract
This paper is devoted to the structure that describes the construction of finite distributive lattices From the viewpoint of application we consider algorithms of construction and enumeration of distributive lattices and partially ordered sets for finite distributive lattices A formula for finding the maximum antichain with respect to nonintersection is given it is shown that elements of the lattice can be split into pairs according to comparison the point of the maximum number of elements in the lattices is considered and the structure of lattice congruence is described
Keywords: