Bijections between colored compositions, Dyck paths, and polygon partitions

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Gil, Juan B., Hoover, Emma G., Shearer, Jessica A.
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866916241214537728
author Gil, Juan B.
Hoover, Emma G.
Shearer, Jessica A.
author_facet Gil, Juan B.
Hoover, Emma G.
Shearer, Jessica A.
contents In this paper, we give part-preserving bijections between three fundamental families of objects that serve as natural framework for many problems in enumerative combinatorics. Specifically, we consider compositions, Dyck paths, and partitions of a convex polygon, and identify suitable building blocks that are then appropriately decorated to achieve matching cardinalities. Our bijections are constructive and apply for the general case where the building blocks are allowed to come in different colors.
format Preprint
id arxiv_https___arxiv_org_abs_2403_04575
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Bijections between colored compositions, Dyck paths, and polygon partitions
Gil, Juan B.
Hoover, Emma G.
Shearer, Jessica A.
Combinatorics
05A19
In this paper, we give part-preserving bijections between three fundamental families of objects that serve as natural framework for many problems in enumerative combinatorics. Specifically, we consider compositions, Dyck paths, and partitions of a convex polygon, and identify suitable building blocks that are then appropriately decorated to achieve matching cardinalities. Our bijections are constructive and apply for the general case where the building blocks are allowed to come in different colors.
title Bijections between colored compositions, Dyck paths, and polygon partitions
topic Combinatorics
05A19
url https://arxiv.org/abs/2403.04575