La Dynamique du lapin

Présentées conjointement, ces deux briques de la chaîne sont en effet intimement liées. Via la présentation de certains outils, nous verrons comment l’enrichissement d’un document numérique à l’aide

Les réseaux constituent une structure pratique pour représenter des données relationnelles de façon à donner un aperçu de groupes et interactions.

Alexandre HERLEA est membre de la section « Sciences, histoire des sciences et des techniques et archéologie industrielle » du CTHS. Professeur émérite des universités, membre effectif de l'Académie

Rédaction des Plans de Gestion de Données (PGD) sous l’angle des besoins de la communauté mathématique.

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)

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

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

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.

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):

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

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

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