Counting corners in partitions (Q2634576): Difference between revisions

A corner in a partition \(\pi\) of an integer \(n\) is a point of degree two in the corresponding Ferrers diagram and a corner is said to be of type \((a,b)\) if it is at the bottom right of a specific maximal \(a\times b\) rectangle (where \(b\) is its length and \(a\) is its height). The corners of type \((a+,b)\) are corners of type \((j,b)\) for any \(j\geq a\); the corners of type \((a+,b+)\) are similarly defined. The size of corners of type \((a,b)\) is said to be equal to \(a+b\). In this paper the generating functions for the total numbers of a) all corners, b) corners of type \((a,b)\), c) corners of type \((a+,b)\), d) corners of type \((a+,b+)\), e) corners of size \(m\) are deduced, as well as the main term asymptotics for the average numbers of such corners. For example, in the first two cases the main terms are \(\frac{\sqrt{6n}}{\pi}\) and \(\frac{a!b!\sqrt{6n}}{\pi (a+b+1)!}\), respectively. The asymptotics proofs rely on a general asymptotic scheme for moments of partition statistics developed by \textit{P. J. Grabner} et al. [Comb. Probab. Comput. 23, No. 6, 1057--1086 (2014; Zbl 1304.11123)].