Counting set systems by weight

Details Counting set systems by weight Counting set systems by weight

2004-04-11

arxiv.org/abs/math/0404217v1

Mathematics

Combinatorics

10 pages

Scientific paper

Applying the enumeration of sparse set partitions, we show that the number of set systems H such that the emptyset is not in H, the total cardinality of edges in H is n, and the vertex set of H is {1, 2, ..., m}, equals (1/log(2)+o(1))^nb_n where b_n is the n-th Bell number. The same asymptotics holds if H may be a multiset. If vertex degrees in H are restricted to be at most k, the asymptotics is (1/alpha_k+o(1))^nb_n where alpha_k is the unique root of x^k/k!+...+x^1/1!-1 in (0,1].

Affiliated with

Also associated with

No associations

Rating

Counting set systems by weight does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting set systems by weight, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting set systems by weight will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-5208