2015/07/27 by Liu, Ricky Ini
#05E10 #20C30 #Combinatorics (math.CO) #FOS: Mathematics #Representation Theory (math.RT)
paper · doi:10.48550/arxiv.1507.07287
We give a combinatorial description for when the Specht module of an arbitrary diagram admits a (complete) branching rule. This description, given in terms of the maximal rectangles of the diagram, generalizes all previously known branching rules for Specht modules, such as those given by Reiner and Shimozono for northwest diagrams and by the present author for forest diagrams.