Abstract
In this paper, we study the generating function for the number of set partitions of [n] represented as bargraphs according to the perimeter/site-perimeter. In particular, we find explicit formulas for the total perimeter and the total site-perimeter over all set partitions of [n].
| Original language | English |
|---|---|
| Article number | #P2.30 |
| Journal | Electronic Journal of Combinatorics |
| Volume | 26 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2019 |
Bibliographical note
Publisher Copyright:© The author.
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics