29
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      On the shard intersection order of a Coxeter group

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Introduced by Reading, the shard intersection order of a finite Coxeter group \(W\) is a lattice structure on the elements of \(W\) that contains the poset of noncrossing partitions \(NC(W)\) as a sublattice. Building on work of Bancroft in the case of the symmetric group, we provide combinatorial models for shard intersections of all classical types, and use this understanding to prove the shard intersection order is EL-shellable. Further, inspired by work of Simion and Ullman on the lattice of noncrossing partitions, we show that the shard intersection order on the symmetric group admits a symmetric boolean decomposition, i.e., a partition into disjoint boolean algebras whose middle ranks coincide with the middle rank of the poset. Our decomposition also yields a new symmetric boolean decomposition of the noncrossing partition lattice.

          Related collections

          Author and article information

          Journal
          2011-08-29
          2013-06-14
          Article
          1108.5761
          0eef2c1e-b617-4b38-aca0-8620b869cf77

          http://arxiv.org/licenses/nonexclusive-distrib/1.0/

          History
          Custom metadata
          33 pages, several figures. The current version subsumes the results of the previous version, but adds proof of EL-shellability in types A, B, and D
          math.CO

          Combinatorics
          Combinatorics

          Comments

          Comment on this article