Strong descent numbers and Turán type theorems

Ron M. Adin; Yuval Roichman

Strong descent numbers and Turán type theorems

Department of Mathematics

Research output: Contribution to conference › Paper › peer-review

Abstract

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.

Original language	English
Pages	338-345
Number of pages	8
State	Published - 2006
Event	18th Annual International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2006 - San Diego, CA, United States Duration: 19 Jun 2006 → 23 Jun 2006

Conference

Conference	18th Annual International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2006
Country/Territory	United States
City	San Diego, CA
Period	19/06/06 → 23/06/06

Keywords

Bruhat order
Descent number
Symmetric group
Turan graph

Cite this

@conference{2dc17c5df610485e871aa9ee4eedd495,

title = "Strong descent numbers and Tur{\'a}n type theorems",

abstract = "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{\'a}n from extremal graph theory.",

keywords = "Bruhat order, Descent number, Symmetric group, Turan graph",

author = "Adin, \{Ron M.\} and Yuval Roichman",

year = "2006",

language = "אנגלית",

pages = "338--345",

note = "18th Annual International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2006 ; Conference date: 19-06-2006 Through 23-06-2006",

}

TY - CONF

T1 - Strong descent numbers and Turán type theorems

AU - Adin, Ron M.

AU - Roichman, Yuval

PY - 2006

Y1 - 2006

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.

KW - Bruhat order

KW - Descent number

KW - Symmetric group

KW - Turan graph

UR - https://www.scopus.com/pages/publications/84860601034

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:84860601034

SP - 338

EP - 345

T2 - 18th Annual International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2006

Y2 - 19 June 2006 through 23 June 2006

ER -

Strong descent numbers and Turán type theorems

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this