Cours/Séminaire
Notice

# Alexander HULPKE - Computational group theory, cohomology of groups and topological methods 4

Réalisation : 16 juin 2022 - Mise en ligne : 19 octobre 2022
• document 1 document 2 document 3
• niveau 1 niveau 2 niveau 3
Thème

## Sur le même thème

• Cours/Séminaire
00:49:55

### Aurel PAGE - Cohomology of arithmetic groups and number theory: geometric, asymptotic and computati…

Page
Aurel regis

In this lecture series, the first part will be dedicated to cohomology of arithmetic groups of lower ranks (e.g., Bianchi groups), their associated geometric models (mainly from hyperbolic geometry)

• Cours/Séminaire
00:56:40

### Phong NGUYEN - Recent progress on lattices's computations 2

Nguyen
Phong Q.

This is an introduction to the mysterious world of lattice algorithms, which have found many applications in computer science, notably in cryptography. We will explain how lattices are represented by

• Cours/Séminaire
00:42:03

### Alexander HULPKE - Computational group theory, cohomology of groups and topological methods 5

The lecture series will give an introduction to the computer algebra system GAP, focussing on calculations involving cohomology. We will describe the mathematics underlying the algorithms, and how to

• Cours/Séminaire
00:51:09

### Zachary Himes - On not the rational dualizing module for $\text{Aut}(F_n)$

Bestvina--Feighn proved that $\text{Aut}(F_n)$ is a rational duality group, i.e. there is a $\mathbb{Q}[\text{Aut}(F_n)]$-module, called the rational dualizing module, and a form of Poincar\'e duality

• Cours/Séminaire
00:56:39

### Tobias Moede - Coclass theory for nilpotent associative algebras

The coclass of a finite p-group of order p^n and class c is defined as n-c. Using coclass as the primary invariant in the investigation of finite p-groups turned out to be a very fruitful approach.

• Cours/Séminaire
00:44:13

### Oussama Hamza - Hilbert series and mild groups

Let $p$ be an odd prime number and $G$ a finitely generated pro-$p$ group. Define $I(G)$ the augmentation ideal of the group algebra of $G$ over $F_p$ and define the Hilbert series of $G$ by: \$G(t):

• Cours/Séminaire
01:01:58

### Gabriele NEBE - Lattices, Perfects lattices, Voronoi reduction theory, modular forms, computations …

Nebe
Gabriele

The talks of Coulangeon will introduce the notion of perfect, eutactic and extreme lattices and the Voronoi's algorithm to enumerate perfect lattices (both Eulcidean and Hermitian). The talk of Nebe

• Conférence
00:33:54

### Alexandre Booms : « Usage de matériel pédagogique adapté en géométrie : une transposition à interro…

« Usage de matériel pédagogique adapté en géométrie : une transposition à interroger ». Alexandre Booms, doctorant (Université de Reims Champagne-Ardenne - Cérep UR 4692)

• Cours/Séminaire
01:06:33

### Paul GUNNELLS - Cohomology of arithmetic groups and number theory: geometric, asymptotic and comput…

Gunnells
Paul E.

In this lecture series, the first part will be dedicated to cohomology of arithmetic groups of lower ranks (e.g., Bianchi groups), their associated geometric models (mainly from hyperbolic geometry)

• Cours/Séminaire
01:11:43

### Paul GUNNELLS - Cohomology of arithmetic groups and number theory: geometric, asymptotic and comput…

Gunnells
Paul E.

In this lecture series, the first part will be dedicated to cohomology of arithmetic groups of lower ranks (e.g., Bianchi groups), their associated geometric models (mainly from hyperbolic geometry)

• Cours/Séminaire
01:05:40

### Paul GUNNELLS - Cohomology of arithmetic groups and number theory: geometric, asymptotic and comput…

Gunnells
Paul E.

In this lecture series, the first part will be dedicated to cohomology of arithmetic groups of lower ranks (e.g., Bianchi groups), their associated geometric models (mainly from hyperbolic geometry)

• Cours/Séminaire
00:52:35

### Graham ELLIS - Computational group theory, cohomology of groups and topological methods 3

Ellis
Graham

The lecture series will give an introduction to the computer algebra system GAP, focussing on calculations involving cohomology. We will describe the mathematics underlying the algorithms, and how to