The structure of finite distributive lattices

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 anti-chain with respect to nonintersection is given, it is shown that elements of the lattice can be split into pairs according to comparison, we consider the point of the maximum number of elements in the lattices, and the structure of lattice congruence is described.