Nested sets, set partitions and Kirkman-Cayley dissection numbers
From MaRDI portal
Publication:458606
Abstract: In this paper we show a a proof by explicit bijections of the famous Kirkman-Cayley formula for the number of dissections of a convex polygon. Our starting point is the bijective correspondence between the set of nested sets made by (k) subsets of ({1,2,...,n}) with cardinality (geq 2) and the set of partitions of ({1,2,...,n+k-1}) into (k) parts with cardinality (geq 2).
Recommendations
- scientific article; zbMATH DE number 6739377
- Crossings and nestings in set partitions of classical types
- Crossings and nestings in set partitions of classical types
- Set partitions and integrable hierarchies
- Nested sets and Jeffrey-Kirwan residues
- A decomposition of partitions and numerical sets
- Set Partitions with No m-Nesting
- scientific article; zbMATH DE number 975326
- On the sets represented by the partitions of an integer \(n\)
- Combinatorics of set partitions
Cites work
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 2135024 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 1869680 (Why is no real title available?)
- scientific article; zbMATH DE number 1390038 (Why is no real title available?)
- A compactification of configuration spaces
- Applications of antilexicographic order. I: An enumerative theory of trees
- Cellular structures determined by polygons and trees
- Complexes of trees and nested set complexes
- Faces of generalized permutohedra
- Geometry of the space of phylogenetic trees
- Hyperplane arrangements and holonomy equations
- Incidence combinatorics of resolutions
- Nested sets and Jeffrey-Kirwan residues
- On models of the braid arrangement and their hidden symmetries
- On stretching the interval simplex-permutohedron
- Permutohedra, Associahedra, and Beyond
- Permutonestohedra
- Polygon dissections and Euler, Fuss, Kirkman, and Cayley numbers
- Polygon dissections and standard Young tableaux
- The permutoassociahedron, Mac Lane's coherence theorem and asymptotic zones for the KZ equation
- The tropical Grassmannian
- Wonderful models of subspace arrangements
Cited in
(8)- Exponential formulas for models of complex reflection groups
- Cayley compositions, partitions, polytopes, and geometric bijections
- Polygon dissections and Euler, Fuss, Kirkman, and Cayley numbers
- Set Partitions with No m-Nesting
- Wonderful models for generalized Dowling arrangements
- Colored partitions of a convex polygon by noncrossing diagonals
- Crossings and nestings in set partitions of classical types
- Counting quiddities of polygon dissections
This page was built for publication: Nested sets, set partitions and Kirkman-Cayley dissection numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458606)
