Noncrossing partitions and the shard intersection order

zbMATHMaRDI QIDQ3176613FDO

Authors Nathan Reading

Publication date 23 July 2018

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAK0162

zbMATH Keywords

noncrossing partitionweak orderlattice congruenceshard

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial aspects of simplicial complexes (05E45) Combinatorics of partially ordered sets (06A07) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Recommendations

• Noncrossing partitions and the shard intersection order
• On the shard intersection order of a Coxeter group
• Noncrossing partitions and Bruhat order
• Non-crossing partition lattices in finite real reflection groups
• Parallelizing pairings on Hessian elliptic curves

Cited in

(12)

• Shard Polytopes
• Parallelizing pairings on Hessian elliptic curves
• Noncrossing partitions, Bruhat order and the cluster complex
• Noncrossing Partitions for the GroupDn
• Shard polytopes
• Shellability of noncrossing partition lattices
• Ballot-noncrossing partitions
• On the shard intersection order of a Coxeter group
• On maximal chains in the non-crossing partition lattice
• Noncrossing partitions and the shard intersection order
• Generalized non-crossing partitions and buildings
• Congruence normality of simplicial hyperplane arrangements via oriented matroids

This page was built for publication: Noncrossing partitions and the shard intersection order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176613)