Colored partitions of a convex polygon by noncrossing diagonals

  title={Colored partitions of a convex polygon by noncrossing diagonals},
  author={Daniel Birmajer and J. Gil and M. Weiner},
  journal={Discret. Math.},
For any positive integers a and b , we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to b modulo a . For the number of such partitions made by a fixed number of diagonals, we give both a recurrence relation and an explicit representation in terms of partial Bell polynomials. We use basic properties of these polynomials to efficiently incorporate restrictions on the type of polygons allowed in the partitions. 
A family of Bell transformations
Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs
Some relatives of the Catalan sequence


Nested sets, set partitions and Kirkman-Cayley dissection numbers
  • G. Gaiffi
  • Computer Science, Mathematics
  • Eur. J. Comb.
  • 2015
XII. On the K-partitions of the R-gon and R-ace
  • T. Kirkman
  • Engineering
  • Philosophical Transactions of the Royal Society of London
  • 1857
Polygon Dissections and Euler, Fuss, Kirkman, and Cayley Numbers
Polygon Dissections and Standard Young Tableaux
  • R. Stanley
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 1996
Variants of Schroeder Dissections
Some Convolution Identities and an Inverse Relation Involving Partial Bell Polynomials
Advanced Combinatorics The Art Of Finite And Infinite Expansions
The On-Line Encyclopedia of Integer Sequences
  • N. Sloane
  • Mathematics, Computer Science
  • Electron. J. Comb.
  • 1994
Note on a Geometrical Theorem
Exponential polynomials