On the Likelihood of Comparability in Bruhat Order

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
28 pages, 8 figures

Keywords

Probability, Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/112843

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0605490
 http://arxiv.org/abs/math/0605490

Collections

arXiv