# Two by two squares in set partitions

Margaret Archibald, Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher, Toufik Mansour

Research output: Contribution to journalArticlepeer-review

## Abstract

A partition πof a set S is a collection B1, B2, ..., Bk of non-empty disjoint subsets, alled blocks, of S such that âi=1kBi=S. $\begin{array}{} \displaystyle \bigcup-{i=1}kBi=S. \end{array}$ We assume that B1, B2, ..., Bk are listed in canonical order; that is in increasing order of their minimal elements; so min B1 < min B2 < â» < min Bk. A partition into k blocks can be represented by a word π= π1π2â»πn, where for 1 ≤ j ≤ n, πj â&circ;&circ; [k] and âi=1n{πi}=[k], $\begin{array}{} \displaystyle \bigcup-{i=1}n \{\pi-i\}=[k], \end{array}$ and πj indicates that j â&circ;&circ; Bπ j. The canonical representations of all set partitions of [n] are precisely the words π= π1π2â»πn such that π1 = 1, and if i < j then the first occurrence of the letter i precedes the first occurrence of j. Such words are known as restricted growth functions. In this paper we find the number of squares of side two in the bargraph representation of the restricted growth functions of set partitions of [n]. These squares can overlap and their bases are not necessarily on the x-axis. We determine the generating function P(x, y, q) for the number of set partitions of [n] with exactly k blocks according to the number of squares of size two. From this we derive exact and asymptotic formulae for the mean number of two by two squares over all set partitions of [n].

Original language English 29-40 12 Mathematica Slovaca 70 1 https://doi.org/10.1515/ms-2017-0328 Published - 1 Feb 2020

## Keywords

• Bell numbers
• Generating functions
• Restricted growth functions
• Set partitions

## All Science Journal Classification (ASJC) codes

• Mathematics(all)

## Fingerprint

Dive into the research topics of 'Two by two squares in set partitions'. Together they form a unique fingerprint.