Cartesian Lattice Counting by the Vertical 2-sum
Tóm tắt
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.
Tài liệu tham khảo
Erné, M., Heitzig, J, Reinhold, J: On the number of distributive lattices. Electron. J. Combin. 9, Article #R24 (2002)
Gebhardt, V, Tawn, S: Constructing unlabelled lattices. J. Algebra 545, 213–236 (2020)
Heitzig, J, Reinhold, J: Counting finite lattices. Algebra Univ. 48, 43–53 (2002)
Jipsen, P, Lawless, N: Generating all finite modular lattices of a given size. Algebra Univ. 74, 253–264 (2015)
Kohonen, J: Generating modular lattices of up to 30 elements. Order 36, 423–435 (2018)
Kohonen, J: Exponential lower bounds of lattice counts by vertical sum and 2-sum. Algebra Univ. 80 (2019)
Dowling, T A, Wilson, R M: Whitney number inequalities for geometric lattices. Proc. Amer. Math. Soc. 47, 504–512 (1975)
Björner, A.: Shellable and Cohen-Macaulay partially ordered sets. Trans. Amer. Math. Soc. 260, 159–183 (1980)
Collins, K L: Planar lattices are lexicographically shellable. Order 8, 375–381 (1992)
Grätzer, G.: Lattice theory: Foundation. Birkhäuser, Basel (2011)
McKay, B D, Piperno, A: Nauty and Traces home page. http://pallini.di.uniroma1.it/
McKay, B D, Piperno, A: Practical graph isomorphism, II. J. Symbolic Comput. 60, 94–112 (2014)
OEIS, the on-line encyclopedia of integer sequences. https://oeis.org/A006981. Number of unlabeled modular lattices with n elements
Kohonen, J: Cartesian lattice counting. https://bitbucket.org/jkohonen/cartesian-lattice-counting/
OEIS, the on-line encyclopedia of integer sequences. https://oeis.org/A006982. Number of unlabeled distributive lattices with n elements
Kohonen, J: Lists of finite lattices (modular, semimodular, graded and geometric). https://doi.org/10.23728/b2share.dbb096da4e364b5e9e37b982431f41de
Wilson, R M: Nonisomorphic Steiner triple systems. Math. Z. 135, 303–313 (1974)
Keevash, P: Counting Steiner triple systems. In: European Congress of Mathematics, pp. 459–481 (2018)
Kohonen, J: Modular and distributive lattices without vertical sums and 2-sums. https://doi.org/10.23728/b2share.80c0b996508b4a7b8f9bb6b7919c492a
The Tukaani Project: XZ Utils. https://tukaani.org/xz/