Saúl A. Blanco - Shortest path poset of Bruhat intervals

dmtcs:2902 - Discrete Mathematics & Theoretical Computer Science, January 1, 2011, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) - https://doi.org/10.46298/dmtcs.2902
Shortest path poset of Bruhat intervals

Authors: Saúl A. Blanco

    Let $[u,v]$ be a Bruhat interval and $B(u,v)$ be its corresponding Bruhat graph. The combinatorial and topological structure of the longest $u-v$ paths of $B(u,v)$ has been extensively studied and is well-known. Nevertheless, not much is known of the remaining paths. Here we describe combinatorial properties of the shortest $u-v$ paths of $B(u,v)$. We also derive the non-negativity of some coefficients of the complete mcd-index of $[u,v]$.


    Volume: DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
    Section: Proceedings
    Published on: January 1, 2011
    Imported on: January 31, 2017
    Keywords: Bruhat interval,shortest-path poset,complete \textrmcd-index,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
    Fundings :
      Source : OpenAIRE Research Graph
    • Quasisymmetric Functions and Eulerian Enumeration; Funder: National Science Foundation; Code: 0555268

    Linked data

    Source : ScholeXplorer References DOI 10.1112/s0010437x06001928
    • 10.1112/s0010437x06001928
    • 10.1112/s0010437x06001928
    The cd -index of fans and posets
    Kalle Karu ;

    Share

    Consultation statistics

    This page has been seen 125 times.
    This article's PDF has been downloaded 122 times.