COUNTING 1 \times 2 RECTANGLES IN SET PARTITIONS
Overview & Synopsis
In this paper, we study the generating function for the number of set partitions of [n] represented as bargraphs, according to the number of rectangles of dimensions 1 × 2. In particular, we find an explicit formula and an asymptotic formula for the total number of 1 × 2 rectangles over set partitions of [n].
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | COUNTING 1 \times 2 RECTANGLES IN SET PARTITIONS |
|---|---|
| Author / Organization | Nenad Cakic, Toufik Mansour, Shabani Armend |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2018 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-161711 |
| Original Source Link | Visit Source Page on hal.science » |