TY - JOUR
T1 - Strong descent numbers and Turán type theorems
AU - Adin, Ron M.
AU - Roichman, Yuval
PY - 2006/12/1
Y1 - 2006/12/1
N2 - For a permutation π in the symmetric group S n let the total degree be its valency in the Hasse diagram of the strong Bruhat order on S n, and let the 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.
AB - For a permutation π in the symmetric group S n let the total degree be its valency in the Hasse diagram of the strong Bruhat order on S n, and let the 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.
UR - http://www.scopus.com/inward/record.url?scp=84860601034&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
JO - FPSAC 2006 - Proceedings: 18th Annual International Conference on Formal Power Series and Algebraic Combinatorics
JF - FPSAC 2006 - Proceedings: 18th Annual International Conference on Formal Power Series and Algebraic Combinatorics
ER -