Math 2.0

Areas Algebraic combinatorics Topic

Coxeter-Catalan combinatorics

Summary

This topic is a part of algebraic combinatorics. It covers the objects counted by the Catalan number of a finite reflection group, such as noncrossing and nonnesting partitions, clusters, sortable elements and Cambrian lattices, and the uniform results that connect them.

About this page
Tag7CZT1KQ95P
URIm2://7CZT1KQ95P
Kindtopic
WritingW0 stub
MSC05E16, 20F55, 05A18
Part ofAlgebraic combinatorics
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.