Papers
Topics
Authors
Recent
Search
2000 character limit reached

Set families and Foulkes modules

Published 17 Jul 2010 in math.RT and math.CO | (1007.2946v2)

Abstract: We construct a new family of homomorphisms from Specht modules into Foulkes modules for the symmetric group. These homomorphisms are used to give a combinatorial description of the minimal partitions (in the dominance order) which label irreducible characters appearing as summands of the characters of Foulkes modules. The homomorphisms are defined using certain families of subsets of the natural numbers. These families are of independent interest; we prove a number of combinatorial results concerning them.

Authors (2)

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.