Abstract
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 lattices depending on the symmetry case. Here the symmetry cases are analyzed, and a recurrence relation is presented that expresses the number of nonisomorphic vertical 2-sums in some desired family of graded lattices. Nonisomorphic, vertically indecomposable modular and distributive lattices are counted and classified up to 35 and 60 elements respectively. Asymptotically their numbers are shown to be at least Ω(2.3122n) and Ω(1.7250n), where n is the number of elements. The number of semimodular lattices is shown to grow faster than any exponential in n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
