Papers
Topics
Authors
Recent
Search
2000 character limit reached

Complete branching rules for Specht modules

Published 27 Jul 2015 in math.RT and math.CO | (1507.07287v1)

Abstract: 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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.