Superinduction for pattern groups

Details Superinduction for pattern groups Superinduction for pattern groups

2007-12-07

arxiv.org/abs/0712.1228v1

J. Algebra 321 (2009), 3681-3703

Mathematics

Representation Theory

Scientific paper

10.1016/j.jalgebra.2009.03.003

It is well-known that the representation theory of the finite group of unipotent upper-triangular matrices $U_n$ over a finite field is a wild problem. By instead considering approximately irreducible representations (supercharacters), one obtains a rich combinatorial theory analogous to that of the symmetric group, where we replace partition combinatorics with set-partitions. This paper studies Diaconis--Isaacs' concept of superinduction in pattern groups. While superinduction shares many desirable properties with usual induction, it no longer takes characters to characters. We begin by finding sufficient conditions guaranteeing that super-induction is in fact induction. It turns out for natural embedding of $U_m$ in $U_n$, super-induction is induction. We conclude with an explicit combinatorial algorithm for computing this induction analogous to the Pieri-formulas for the symmetric group.

Affiliated with

Also associated with

No associations

Rating

Superinduction for pattern groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Superinduction for pattern groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Superinduction for pattern groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-324881