Abstract
A partition of a positive integer n is a finite nonincreasing sequence of positive integers whose sum is n. Integer partitions can be graphically represented through Ferrers diagrams (graphs). These diagrams may contain smaller partitions, defined as cell patterns. In this paper, we study the number of different types of cell patterns lying entirely in partitions of n. Using the generating functions method we will enumerate integer partitions according to cell patterns of several types.
Original language | English |
---|---|
Pages (from-to) | 51-63 |
Number of pages | 13 |
Journal | Journal of Automata, Languages and Combinatorics |
Volume | 24 |
Issue number | 1 |
DOIs | |
State | Published - 2019 |
Bibliographical note
Publisher Copyright:© Institut für Informatik Justus-Liebig-Universität Giessen.
Keywords
- Bargraphs
- Partitions
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics