×

Two analogues of a classical sequence. (English) Zbl 1004.05002

Summary: We compute exponential generating functions for the numbers of edges in the Hasse diagrams for the \(B\)- and \(D\)-analogues of the partition lattices.

MSC:

05A15 Exact enumeration problems, generating functions
05A18 Partitions of sets
05B35 Combinatorial aspects of matroids and geometric lattices
06A07 Combinatorics of partially ordered sets

Software:

OEIS
PDFBibTeX XMLCite
Full Text: EuDML EMIS