{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:12:31Z","timestamp":1758280351408,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Hultman, Linusson, Shareshian, and Sj\u00f6strand gave a pattern avoidance characterization of the permutations\u00a0for which the number of chambers of its associated inversion arrangement is the same as the size of its lower interval\u00a0in Bruhat order. Hultman later gave a characterization, valid for an arbitrary finite reflection group, in terms of distances\u00a0in the Bruhat graph. On the other hand, the pattern avoidance criterion for permutations had earlier appeared in\u00a0independent work of Sj\u00f6strand and of Gasharov and Reiner. We give characterizations of the elements of the\u00a0hyperoctahedral groups satisfying Hultman's criterion that is in the spirit of those of Sj\u00f6strand and of Gasharov and\u00a0Reiner. We also give a pattern avoidance criterion using the notion of pattern avoidance defined by Billey and Postnikov.<\/jats:p>","DOI":"10.37236\/7636","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T10:24:02Z","timestamp":1578651842000},"source":"Crossref","is-referenced-by-count":0,"title":["Hultman Elements for the Hyperoctahedral Groups"],"prefix":"10.37236","volume":"25","author":[{"given":"Alexander","family":"Woo","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2018,6,8]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p41\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p41\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T23:31:27Z","timestamp":1579217487000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i2p41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,8]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,4,13]]}},"URL":"https:\/\/doi.org\/10.37236\/7636","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,6,8]]},"article-number":"P2.41"}}