Records in set partitions
Summary: A partition of \([n]= \{1,2,\dots, n\}\) is a decomposition of \([n]\) into nonempty subsets called blocks. We make use of the canonical representation of a partition as a word over a finite alphabet, known as a restricted growth function. An element \(a_i\) in such a word \(\pi\) is a strong (weak) record if \(a_i>a_j\) \((a_i>a_j)\) for all \(j=1,2,\dots, i-1\). Furthermore, the position of this record is \(i\). We derive generating functions for the total number of strong (weak) records in all words corresponding to partitions of \([n]\), as well as for the sum of the positions of the records. In addition we find the asymptotic mean values and variances for the number, and for the sum of positions, of strong (weak) records in all partitions of \([n]\).
- Fixed points of a random restricted growth sequence
- Sum of weighted records in set partitions
- Closed expressions for averages of set partition statistics
- A restricted growth word approach to partitions with odd/even size blocks
- Free rises, restricted partitions, and \(q\)-Fibonacci polynomials
- Record statistics in a random composition
- New refined enumerations of set partitions related to sorting
- Elements protected by records in set partitions
- The multiplicity of left-to-right maxima in geometrically distributed words
- Cells of fixed height in Catalan words and restricted growth functions
- Counting symmetric and non-symmetric peaks in a set partition
- Left to right maxima in Dyck prefixes
This page was built for publication: Records in set partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986717)
