Christian Gutschwager
Published 2011-03-31Version 1
We investigate the poset of skew diagrams ordered by adding or forming the union of skew diagrams. We will show that a skew diagram which has at least n convex corners to the upper left and also to the lower right is larger than the skew diagram consisting of n disconnected single boxes. Using this property, we obtain lower bounds for the number of components, constituents and pairs of components which differ by one box in a given skew character.
Comments: 15 pages, contains the corrected Section 3 of http://arxiv.org/abs/1002.1610 with correct proofs
On Base Partitions And Cover Partitions Of Skew Characters
Skew characters and cyclic sieving
On principal hook length partitions and durfee sizes in skew characters
![QR code for arXiv:1104.0008 [math.CO]](http://oss.arxitics.com/images/favicon.svg)