A note on lattices with many sublattices

DOI10.18514/MMN.2019.2821zbMATH Open1449.06004arXiv1812.11512OpenAlexW3037054328MaRDI QIDQ5217982FDOQ5217982

Gábor Czédli, Eszter K. Horváth

Publication date: 26 February 2020

Published in: Miskolc Mathematical Notes (Search for Journal in Brave)

Abstract: For every natural number $ngeq5$, we prove that the number of subuniverses of an $n$-element lattice is $2^n$, $13cdot{2}^{n-4}$, $23cdot{2}^{n-5}$, or less than $23cdot{2}^{n-5}$. By a subuniverse, we mean a sublattice or the emptyset. Also, we describe the $n$-element lattices with exactly $2^n$, $13cdot{2}^{n-4}$, or $23cdot{2}^{n-5}$ subuniverses.

Full work available at URL: https://arxiv.org/abs/1812.11512

zbMATH Keywords

finite latticesublatticesubuniversenumber of sublattices

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Structure theory of lattices (06B05) Lattice ideals, congruence relations (06B10)

Cited In (5)

• Notes on sublattice-lattices
• One hundred twenty-seven subsemilattices and planarity
• Eighty-three sublattices and planarity
• The number of subuniverses, congruences, weak congruences of semilattices defined by trees
• Title not available (Why is that?)

This page was built for publication: A note on lattices with many sublattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217982)