Enumerating lattices of subsets

zbMATH Open1298.05024arXiv1311.6664MaRDI QIDQ2922331FDOQ2922331

Donald M. Davis

Publication date: 10 October 2014

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

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.

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)

Cited In (3)

• Title not available (Why is that?)
• Enumeration of subspaces by dimension sequence
• Collection of finite lattices generated by a poset

Uses Software

• OEIS

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)