The Number of Hierarchical Orderings

Details The Number of Hierarchical Orderings The Number of Hierarchical Orderings

2003-07-04

arxiv.org/abs/math/0307064v1

Mathematics

Combinatorics

7 pages

Scientific paper

An ordered set-partition (or preferential arrangement) of n labeled elements represents a single ``hierarchy''; these are enumerated by the ordered Bell numbers. In this note we determine the number of ``hierarchical orderings'' or ``societies'', where the n elements are first partitioned into m <= n subsets and a hierarchy is specified for each subset. We also consider the unlabeled case, where the ordered Bell numbers are replaced by the composition numbers. If there is only a single hierarchy, we show that the average rank of an element is asymptotic to n/(4 log 2) in the labeled case and to n/4 in the unlabeled case.

Affiliated with

Also associated with

No associations

Rating

The Number of Hierarchical Orderings 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 The Number of Hierarchical Orderings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Number of Hierarchical Orderings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-513587