The Rank and Minimal Border Strip Decompositions of a Skew Partition
Richard P. Stanley
Abstract
Nazarov and Tarasov recently generalized the notion of the rank of a partition to skew partitions. We give several characterizations of the rank of a skew partition and one possible characterization that remains open. One of the characterizations involves the decomposition of a skew shape into a minimal number of border strips, and we develop a theory of these MBSD's as well as of the closely related minimal border strip tableaux. An application is given to the value of a character of the symmetric group Sn indexed by a skew shape z at a permutation whose number of cycles is the rank of z.
Create a lesson
Related papers
Elementary Proofs of Commonality of the House Graph and K4 with One Edge Subdivided
Hao Chen
Cop number of Pk-free graphs without a claw or a fork
Uttam K. Gupta, Dinabandhu Pradhan, Rashmi Rekha Swain
Connectivity keeping pendant extensions of paths in k-connected triangle-free graphs
Menghan Ma, Qinghai Liu, Liping Zhang et al.
Maximal subsets of n× n board without cycles
Giedrius Alkauskas
Sequence Factory: Families of Integer Sequences Generated by Gödel Implication
Volkan Yildiz
Avoiding a partial Latin square with an isotope of a given Latin square
Stijn Cambie, Ian M. Wanless