{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T09:30:26Z","timestamp":1775467826460,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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)&gt;x(i+1)\\}$. This is obtained as a consequence of a sharper version of Deodhar's criterion,  which is valid for all Coxeter groups. <\/jats:p>","DOI":"10.37236\/1246","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T01:26:23Z","timestamp":1578705983000},"source":"Crossref","is-referenced-by-count":6,"title":["An improved tableau criterion for Bruhat order"],"prefix":"10.37236","volume":"3","author":[{"given":"Anders","family":"Bj\u00f6rner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Brenti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[1996,7,12]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v3i1r22\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v3i1r22\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T06:17:13Z","timestamp":1579328233000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v3i1r22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7,12]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[1996,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1246","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,7,12]]},"article-number":"R22"}}