2000 character limit reached
The Hopf monoid on nonnesting supercharacters of pattern groups
Published 21 May 2014 in math.CO and math.RT | (1405.5480v3)
Abstract: We construct supercharacter theories for a collection of unipotent matrix groups and produce a Hopf monoid from the supercharacters. These supercharacter theories are coarser than those defined by Diaconis--Isaacs for algebra groups and have supercharacters and superclasses indexed by nonnesting labeled set partitions. We compute the supercharacter tables and describe the product and coproduct of the Hopf monoid combinatorially. We also show that this Hopf monoid is free.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.