Enumerating lattices of subsets

MaRDI QIDQ2922331zbMATHFDO

Authors Donald M. Davis

Publication date 10 October 2014

Published in Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

latticeenumerationStanley-Reisner ring

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Abstract: Given k sets such that no one is contained in another, there is an associated lattice on the power set P([k]) corresponding to inclusion relations among unions of the sets. Two lattices on P([k]) are equivalent if there is a permutation of [k] under which they correspond. We show that for k=1, 2, 3, and 4, there are 1, 1, 4, and 50 equivalence classes of lattices on P([k]) obtained from sets in this way. We cannot find a reference to previous work on this enumeration problem in the literature, and so wish to introduce it for subsequent investigation. We explain how the problem arose from algebraic topology.

Recommendations

• scientific article; zbMATH DE number 3873390
• Enumerating submultisets of multisets
• Lattices of suborders
• Constructive enumeration of Boolean lattices
• The lattice of embedded subsets
• Lattices of algebraic subsets
• The lattice of finite subspace partitions
• Lattices with sublattices of a given order

Cited in

(4)

• scientific article; zbMATH DE number 4002098 (Why is no real title available?)
• Collection of finite lattices generated by a poset
• scientific article; zbMATH DE number 3924766 (Why is no real title available?)
• Enumeration of subspaces by dimension sequence

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Enumerating lattices of subsets

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