Cell patterns in integer partitions

Toufik Mansour, Armend Sh Shabani, Daniel Yaqubi

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)51-63
Number of pages13
JournalJournal of Automata, Languages and Combinatorics
Issue number1
StatePublished - 2019

Bibliographical note

Publisher Copyright:
© Institut für Informatik Justus-Liebig-Universität Giessen.


  • Bargraphs
  • Partitions

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Cell patterns in integer partitions'. Together they form a unique fingerprint.

Cite this