Expected lengths and distribution functions for Young diagrams in the hook (Q2455513)

A partition of an integer \(n\) fits into a \((k,l)\)-hook if it consists of at most \(k\) integer parts that are at most \(l\). Its Young diagram is a binary \(k\) by \(l\) matrix with parts given by the row sums. Partitions that fit into a common hook are distributed according to their row and column sums. Expected values and asymptotics of this distribution are investigated.