Mathematics – Probability
Scientific paper
2006-05-17
Mathematics
Probability
28 pages, 8 figures
Scientific paper
The poset of permutations of [n] under Bruhat ordering is studied. We give
nontrivial upper and lower bounds for the number of comparable pairs of
permutations in both the weak and strong versions of this order. In light of
numerical experiments, we conjecture that in either case the upper bound is
qualitatively close to the actual number of comparable pairs.
Hammett Adam
Pittel Boris
No associations
LandOfFree
On the Likelihood of Comparability in Bruhat Order 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 On the Likelihood of Comparability in Bruhat Order, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Likelihood of Comparability in Bruhat Order will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-678339