On Degrees in the Hasse Diagram of the Strong Bruhat Order
| dc.creator | Adin, Ron M. | |
| dc.creator | Roichman, Yuval | |
| dc.date | 2005-05-02 | |
| dc.date | 2006-03-12 | |
| dc.date.accessioned | 2026-07-07T06:39:52Z | |
| dc.date.available | 2026-07-07T06:39:52Z | |
| dc.description | For a permutation $π$ in the symmetric group $S_n$ let the {\it total degree} be its valency in the Hasse diagram of the strong Bruhat order on $S_n$, and let the {\it down degree} be the number of permutations which are covered by $π$ in the strong Bruhat order. The maxima of the total degree and the down degree and their values at a random permutation are computed. Proofs involve variants of a classical theorem of Turán from extremal graph theory. | |
| dc.description | 14 pages, minor corrections; to appear in Sém. Lothar. Combin | |
| dc.identifier | https://arxiv.org/abs/math/0505020 | |
| dc.identifier | http://arxiv.org/abs/math/0505020 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/101243 | |
| dc.subject | Combinatorics | |
| dc.subject | 20B30 (Primary) 05C35 (Secondary) | |
| dc.title | On Degrees in the Hasse Diagram of the Strong Bruhat Order | |
| dc.type | text |