Chains, subwords, and fillings: strong equivalence of three definitions of the Bruhat order (Q819190)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5014325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chains, subwords, and fillings: strong equivalence of three definitions of the Bruhat order |
scientific article; zbMATH DE number 5014325 |
Statements
Chains, subwords, and fillings: strong equivalence of three definitions of the Bruhat order (English)
0 references
22 March 2006
0 references
Summary: Let \(S_n\) be the group of permutations of \([n]=\{1,\dots,n\}\). The Bruhat order on \(S_n\) is a partial order relation, for which there are several equivalent definitions. Three well-known conditions are based on ascending chains, subwords, and comparison of matrices, respectively. We express the last using fillings of tableaux, and prove that the three equivalent conditions are satisfied in the same number of ways.
0 references
0.7646040320396423
0 references
0.7617775201797485
0 references
