Colored partitions of a convex polygon by noncrossing diagonals

Daniel Birmajer, Juan B. Gil, Michael D. Weiner

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)563-571
Number of pages9
JournalDiscrete Mathematics
Volume340
Issue number4
DOIs
StatePublished - Apr 1 2017

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Colored partitions of a convex polygon by noncrossing diagonals'. Together they form a unique fingerprint.

Cite this