Enumerative combinatorics
Counting complements in the partition lattice, and hypertrees
Journal of Combinatorial Theory Series A
Combinatorial Enumeration
Hi-index | 0.00 |
Let Φ(u,v=Σm=0∞Σn=0∞cmnnmvn. Bouwkamp and de Bruijn found that there exists a power series Ψ(u,v) satisfying the equation Ψ(tz,z)=log(Σk=0∞rk/k! exp(kΦ(kz,z))). We show that this result can be interpreted combinatorially using hypergraphs. We also explain some facts about φ(u,O) and Ψ(u,0).Shown by Bouwkamp and de Bruijn. by using hypertrees,and we use Lagrange inversion to count hypertress by number of vertices and number of edges of a specified size.