A note on lattices with many sublattices
classification
🧮 math.RA
math.CO
keywords
cdotelementlatticesnumbersubuniversesdescribeemptysetevery
read the original abstract
For every natural number $n\geq 5$, we prove that the number of subuniverses of an $n$-element lattice is $2^n$, $13\cdot 2^{n-4}$, $23\cdot 2^{n-5}$, or less than $23\cdot 2^{n-5}$. By a subuniverse, we mean a sublattice or the emptyset. Also, we describe the $n$-element lattices with exactly $2^n$, $13\cdot 2^{n-4}$, or $23\cdot 2^{n-5}$ subuniverses.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
One hundred twenty-seven subsemilattices and planarity
A finite n-element semilattice is planar if it has at least 127 * 2^(n-8) subsemilattices, and this bound is sharp for n > 8 via an explicit non-planar counterexample with one fewer subsemilattice.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.