Geodesic
Chains, subwords, and fillings: strong equivalence of three definitions of the Bruhat order
The electronic journal of combinatorics, Tome 13 (2006)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $S_n$ be the group of permutations of $[n]=\{1,\ldots,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.
DOI : 10.37236/1143
Classification : 05C38 
@article{10_37236_1143,
     author = {Catalin Zara},
     title = {Chains, subwords, and fillings: strong equivalence of three definitions of the {Bruhat} order},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1143},
     zbl = {1085.05069},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1143/}
}
TY  - JOUR
AU  - Catalin Zara
TI  - Chains, subwords, and fillings: strong equivalence of three definitions of the Bruhat order
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1143/
DO  - 10.37236/1143
ID  - 10_37236_1143
ER  - 
%0 Journal Article
%A Catalin Zara
%T Chains, subwords, and fillings: strong equivalence of three definitions of the Bruhat order
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1143/
%R 10.37236/1143
%F 10_37236_1143
Catalin Zara. Chains, subwords, and fillings: strong equivalence of three definitions of the Bruhat order. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1143

Cité par Sources :