BEGIN:VCALENDAR
PRODID:-//Columba Systems Ltd//NONSGML CPNG/SpringViewer/ICal Output/3.3-
 M3//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20241107T104457Z
DTSTART:20241112T140000Z
DTEND:20241112T150000Z
SUMMARY:Algebra seminar - Pavel Turek
UID:{http://www.columbasystems.com/customers/uom/gpp/eventid/}h14f-m34mdm
 49-56oss6
DESCRIPTION:Title: Multiplicity-free induced characters of symmetric grou
 ps\n\nAbstract: Let n be a sufficiently large positive integer. A charac
 ter is multiplicity-free if its irreducible constituents appear with mul
 tiplicity one. Wildon in 2009 and independently Godsil and Meagher in 20
 10 have found all multiplicity-free permutation characters of the symmet
 ric group S_n. In this talk\, we focus on a significantly more general p
 roblem when the permutation characters are replaced by those induced fro
 m an irreducible character for some subgroup.\n????????????\nDespite the
  nature of the problem\, I explain\, combining results from group theory
 \, representation theory and combinatorics\, why this problem may be fea
 sible and present a close to full answer. I also mention some of my (oft
 en surprising) results to questions about conjugate partitions\, which n
 aturally arise when solving the problem\, and the remarkable complete cl
 assification of subgroups G of S_n\, which have an irreducible character
  which stays multiplicity-free when induced to S_n.\n
STATUS:TENTATIVE
TRANSP:TRANSPARENT
CLASS:PUBLIC
LOCATION:Frank Adams 1\, Alan Turing Building\, Manchester
END:VEVENT
END:VCALENDAR