Counting corners in partitions
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)].
- Durfee square areas and associated partition identities.
- Asymptotic expression for raw moment of the multiplicity of a part in a general partition function
- Counting corners in compositions and set partitions presented as bargraphs
- scientific article; zbMATH DE number 850074
- Enumerations of bargraphs with respect to corner statistics
- Average values of some Z-parameters in a random set partition
- Enumeration of generalized hook partitions
- Counting 1 2 rectangles in set partitions
- A bijective proof of Loehr-Warrington's formulas for the statistics \({\mathrm{ctot}_\frac{q}{p}}\) and \({\mathrm{mid}_\frac{q}{p}}\)
- Explicit expressions for the moments of the size of an \((s,\, s+1)\)-core partition with distinct parts
- A general asymptotic scheme for the analysis of partition statistics
- Bijective proofs of some classical partition identities
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- Restricted integer partition functions
- The arithmetic of partitions into distinct parts
- The On-Line Encyclopedia of Integer Sequences
- Three problems in combinatorial asymptotics
- Two Theorems of Euler and a General Partition Theorem
- Circular bargraphs
- On partitions with \(k\) corners not containing the staircase with one more corner
- A decomposition of column-convex polyominoes and two vertex statistics
- scientific article; zbMATH DE number 502837 (Why is no real title available?)
- Packing Ferrers Shapes
- Counting corners in compositions and set partitions presented as bargraphs
- Counting Blanks in Polygonal Arrangements
- scientific article; zbMATH DE number 1409240 (Why is no real title available?)
- Enumerations of bargraphs with respect to corner statistics
- Counting permutations by the number of vertical edges in their bargraphs
- Enumerations on bargraphs
- Cell patterns in integer partitions
- Shade in partitions
- Casting light on integer partitions
- Interior vertices and edges in integer partitions
This page was built for publication: Counting corners in partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2634576)
