An improved tableau criterion for Bruhat order
The electronic journal of combinatorics, Tome 3 (1996) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

To decide whether two permutations are comparable in Bruhat order of $S_n$ with the well-known tableau criterion requires $\binom{n}{2}$ comparisons of entries in certain sorted arrays. We show that to decide whether $x\le y$ only $d_1+d_2+...+d_k$ of these comparisons are needed, where $\{d_1,d_2,...,d_k\} = \{i|x(i)>x(i+1)\}$. This is obtained as a consequence of a sharper version of Deodhar's criterion, which is valid for all Coxeter groups.
DOI : 10.37236/1246
Classification : 20F55, 14M15
Mots-clés : permutations, Bruhat order, tableau criterion, Deodhar's criterion, Coxeter groups
@article{10_37236_1246,
     author = {Anders Bj\"orner and Francesco Brenti},
     title = {An improved tableau criterion for {Bruhat} order},
     journal = {The electronic journal of combinatorics},
     year = {1996},
     volume = {3},
     number = {1},
     doi = {10.37236/1246},
     zbl = {0884.05096},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1246/}
}
TY  - JOUR
AU  - Anders Björner
AU  - Francesco Brenti
TI  - An improved tableau criterion for Bruhat order
JO  - The electronic journal of combinatorics
PY  - 1996
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1246/
DO  - 10.37236/1246
ID  - 10_37236_1246
ER  - 
%0 Journal Article
%A Anders Björner
%A Francesco Brenti
%T An improved tableau criterion for Bruhat order
%J The electronic journal of combinatorics
%D 1996
%V 3
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1246/
%R 10.37236/1246
%F 10_37236_1246
Anders Björner; Francesco Brenti. An improved tableau criterion for Bruhat order. The electronic journal of combinatorics, Tome 3 (1996) no. 1. doi: 10.37236/1246

Cité par Sources :