An archaeology of digital attention: radar, war, and the birth of ubiquitous vigilance
An archaeology of digital attention: radar, war, and the birth of ubiquitous vigilance
Mon compte
Pas encore inscrit ?
An archaeology of digital attention: radar, war, and the birth of ubiquitous vigilance
Séminaire - Actualités des méthodes et terrains au Proche-Orient Ancien Thème 2022 : «Les technologies en archéologie » Séance du vendredi 4 mars 2022, consacrée à La géophysique en archéologie
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
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
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 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 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.
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
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
Applications of twisted homology operations for E_n-algebras
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