• Keine Ergebnisse gefunden

FINITE THEORY

N/A
N/A
Protected

Academic year: 2021

Aktie "FINITE THEORY"

Copied!
4
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

CHARACTER THEORY

OF

FINITE GROUPS

SOMMERSEMESTER 2020

CAROLINE LASSUEUR

TU KAISERSLAUTERN

(2)

CHARACTER

THEORY OF

FINITE GROUPS

552020 BEFORE GroupTheory A.

AND AFTER Linear

Algebra

(Aasttinf Algebra) ( GDM)

Character

Theory

therM.sc .Lectures: Representation

Fachpraktikum

B.sc .&M .se

. Group Theory Theory 1MSc.) (with GAPIMAGMA) Theses

. Cohomology

of

Groups

. Lie Algebras

(3)

CHARACTER

THEORY OF

FINITE GROUPS

552020 INTRODUCTION B.

Aims

of

the lecture :

Character

Tables

of finite groups

: What are

they

?

Elementary

methods to compute them .

What

information

about

finite

groups

do they contain ? Give a

proof of

:

Burnside 's paqb - Theorem:

Letpqbeprime

numbers and let a ,bElNo .

(

ggn ) Then any

finite

group

of

order paq' is soluble .

(4)

CHARACTER

THEORY OF

FINITE GROUPS

552020 PROGRAMME

. Linear

C.

representations

of finite The

groupsmain topics

of

the

lecture

are :

. Characters

of

representations

. The character table

It

. Burnside's paqb.Theorem I Induction and restriction

I . Brauer 's

Characterization of

characters .

( If

time permits )

Referenzen

ÄHNLICHE DOKUMENTE

In this chapter, it is shown that to classify conjugacy classes of a birational diffeomorphism of finite order of the sphere is equivalent to classify birational pairs (X , д) where

Chapter III: Faithful and p-faithful representations of minimal dimension The study of essential dimension of finite and algebraic groups is closely related to the study of its

Most proofs of this fact can actually be used to prove Theorem 1 in all its generality, so there is not much need to provide another proof here.. But yet, let us sketch a proof

Lectures 8–16; topics covered e.g.: rings, ideals, prime and maximal ideals, Chinese remainder theorem, Euclidean rings..

We discuss various (still open) questions on approximation of infinite discrete groups.. We focus on finite-dimensional approximations such as residual finiteness

analogue of classical Lyndon–Tarski theorem for positive ∃- FO pos holds true in the sense of FMT; new proof yields classical version plus preservation (!) of quantifier rank (just

For a class of congestion games, the pure price of anarchy of the average social cost is the worst-case ratio, among all pure Nash equilibria, of the social cost over the optimum

Algebraic automata theory and its corollary, regular language theory, are efficient tools used in computer science for modeling logical circuits, designing compilers,