Maximal Degree in the Strong Bruhat Order of Bn
| dc.creator | Seeman, Tamar | |
| dc.date | 2006-09-11 | |
| dc.date.accessioned | 2026-07-07T07:24:42Z | |
| dc.date.available | 2026-07-07T07:24:42Z | |
| dc.description | Given a permutation P in Sn, let G(P) be the graph on n vertices {1,...,n}, where two vertices i<j are adjacent if i appears right of j in P and there are no integers k with i<k<j and k appearing between i and j in P. Let G'(P) be the graph obtained by dropping the condition that i appears right of j, i.e. two vertices are adjacent if the rectangle [i,P(i)] x [j,P(j)] is empty. In the study of the strong order on permutation, Adin and Roichman introduced these graphs and computed their maximum number of edges. We generalize these results to the Weyl group of signed permutations Bn, working with graphs on vertices {-n,...,n}\{0}, using new variants of a classical theorem of Turan. | |
| dc.identifier | https://arxiv.org/abs/math/0609281 | |
| dc.identifier | http://arxiv.org/abs/math/0609281 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/116463 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C35 | |
| dc.title | Maximal Degree in the Strong Bruhat Order of Bn | |
| dc.type | text |