On degrees in the hasse diagram of the strong Bruhat order

MaRDI QIDQ2654562zbMATH OpenFDO

Authors Ron Adin, Yuval Roichman

Publication date 19 January 2010

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0505020, https://eudml.org/doc/228018, http://www.emis.de/journals/SLC/wpapers/s53adinroi.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

down degreeHasse diagrampermutationrandom permutationstrong Bruhat ordertotal degreesymmetric groupturan's theorem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35)

Abstract: For a permutation $pi$ 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 $pi$ 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'an from extremal graph theory.

Recommendations

• On a conjecture concerning the Bruhat order
• Some conjectures on Brauer character degrees
• Higher Bruhat orders and cyclic hyperplane arrangements
• Order dimension, strong Bruhat order and lattice properties for posets
• A theorem on higher Bruhat orders
• scientific article; zbMATH DE number 3929177
• Degree and the Brauer-Manin obstruction
• The Brumer-Stark conjecture in some families of extensions of specified degree
• Perfect orderings on finite rank Bratteli diagrams
• A combinatorial duality between the weak and strong Bruhat orders

Cited in

(9)

• Coxeter groups, graphs and Ricci curvature
• The maximum difference between the number of atoms and number of coatoms of a Bruhat interval of the symmetric group.
• Alternating sign matrices and their Bruhat order
• Ricci curvature of Bruhat orders
• The Automorphism Group of the Strong Order of the Symmetric Group
• The maximum number of atoms of Bruhat intervals in the symmetric groups.
• On random trees obtained from permutation graphs
• Correlation for permutations
• Orthogonal surfaces and their CP-orders

This page was built for publication: On degrees in the hasse diagram of the strong Bruhat order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2654562)