On the Likelihood of Comparability in Bruhat Order

Simple item page
dc.creatorHammett, Adam
dc.creatorPittel, Boris
dc.date2006-05-17
dc.date.accessioned2026-07-07T07:14:21Z
dc.date.available2026-07-07T07:14:21Z
dc.descriptionThe 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.
dc.description28 pages, 8 figures
dc.identifierhttps://arxiv.org/abs/math/0605490
dc.identifierhttp://arxiv.org/abs/math/0605490
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112843
dc.subjectProbability
dc.subjectCombinatorics
dc.titleOn the Likelihood of Comparability in Bruhat Order
dc.typetext

Files

Collections

arXiv