# Colored partitions of a convex polygon by noncrossing diagonals

@article{Birmajer2017ColoredPO, title={Colored partitions of a convex polygon by noncrossing diagonals}, author={Daniel Birmajer and J. Gil and M. Weiner}, journal={Discret. Math.}, year={2017}, volume={340}, pages={563-571} }

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.

#### Topics from this paper

#### 7 Citations

From Dyck Paths to Standard Young Tableaux

- Mathematics
- 2017

We present nine bijections between classes of Dyck paths and classes of standard Young tableaux (SYT). In particular, we consider SYT of flag and rectangular shapes, we give Dyck path descriptions… Expand

A family of Bell transformations

- Mathematics, Computer Science
- Discret. Math.
- 2019

A glimpse of the versatility of Bell transformations is shown by discussing the enumeration of several combinatorial configurations, including rational Dyck paths, rooted planar maps, and certain classes of permutations. Expand

The general case of cutting of GML surfaces and bodies

- Mathematics
- 2019

Generalized Mobius-Listing bodies and surfaces are generalizations of the classic Mobius band. The original motivation is that for solutions of boundary value problems the knowledge of the domain is… Expand

Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs

- Mathematics, Computer Science
- Discret. Math.
- 2018

It is proved that this is always algebraic, through an explicit combinatorial decomposition depending on $\Delta $, and the decomposition also gives a defining system for $D_{\Delta }(z,\mathbf{0})$, which encodes polygon dissections that restrict these patterns as subgraphs. Expand

Some relatives of the Catalan sequence

- Mathematics, Computer Science
- Adv. Appl. Math.
- 2020

A sufficient condition for positive definiteness of the sequence c_n(a_2,\ldots,a_r) is found and several examples from OEIS are checked. Expand

The general case of cutting of Generalized Möbius-Listing surfaces and bodies

- Mathematics
- 2020

The original motivation to study Generalized Mobius-Listing GML surfaces and bodies was the observation that the solution of boundary value problems greatly depends on the domains. Since around 2010… Expand

Realization of a Method for Calculating Bell Polynomials Based on Compositae of Generating Functions

- Mathematics
- 2018

In this paper different computational methods for calculating partial and n-th complete Bell polynomials are considered. As one of the new methods, the authors propose to use the method for… Expand

#### References

SHOWING 1-10 OF 10 REFERENCES

Nested sets, set partitions and Kirkman-Cayley dissection numbers

- Computer Science, Mathematics
- Eur. J. Comb.
- 2015

A proof by explicit bijections of the famous Kirkman-Cayley formula for the number of dissections of a convex polygon is shown. Expand

XII. On the K-partitions of the R-gon and R-ace

- Engineering
- Philosophical Transactions of the Royal Society of London
- 1857

I. By the k-partitions of an r-gon, I mean the number of ways in which it can be divided by k — 1 diagonals, of which none crosses another; two ways being different only when no cyclical permutation… Expand

Polygon Dissections and Euler, Fuss, Kirkman, and Cayley Numbers

- Computer Science, Mathematics
- J. Comb. Theory, Ser. A
- 2000

A short and elementary proof of the formulas for classical numbers of polygon dissections is given and the relationship between the proof, recent work in knot theory, and Jones' work on planar algebras is described. Expand

Polygon Dissections and Standard Young Tableaux

- Computer Science, Mathematics
- J. Comb. Theory, Ser. A
- 1996

A simple bijection is given between dissections of a convex (n+2)-gon withddiagonals not intersecting in their interiors and standard Young tableaux of shape (d+1, d+1, 1n?1?d).

Variants of Schroeder Dissections

- Mathematics
- 1999

Some formulae are given for the enumeration of certain types of dissections of the convex (n+2)-gon by non-crossing diagonals. The classical Schroeder and Motzkin numbers are addressed using a… Expand

Some Convolution Identities and an Inverse Relation Involving Partial Bell Polynomials

- Mathematics, Computer Science
- Electron. J. Comb.
- 2012

We prove an inverse relation and a family of convolution formulas involving partial Bell polynomials. Known and some presumably new combinatorial identities of convolution type are discussed. Our… Expand

The On-Line Encyclopedia of Integer Sequences

- Mathematics, Computer Science
- Electron. J. Comb.
- 1994

The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used. Expand

Exponential polynomials