{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:25Z","timestamp":1753893865151,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In this paper we introduce a way of partitioning the paths of shortest lengths in the Bruhat graph $B(u,v)$ of a Bruhat interval $[u,v]$ into rank posets $P_{i}$ in a way that each $P_{i}$ has a unique maximal chain that is rising under a reflection order. In the case where each $P_{i}$ has rank three, the construction yields a combinatorial description of some terms of the complete $\\textbf{cd}$-index as a sum of ordinary $\\textbf{cd}$-indices of Eulerian posets obtained from each of the $P_{i}$.<\/jats:p>","DOI":"10.37236\/7910","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:04:46Z","timestamp":1578668686000},"source":"Crossref","is-referenced-by-count":0,"title":["Flip Posets of Bruhat Intervals"],"prefix":"10.37236","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2315-5331","authenticated-orcid":false,"given":"Sa\u00fal A.","family":"Blanco","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2018,10,19]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i4p16\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i4p16\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:22:10Z","timestamp":1579234930000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i4p16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,19]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,10,5]]}},"URL":"https:\/\/doi.org\/10.37236\/7910","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,10,19]]},"article-number":"P4.16"}}