Wed, 16 Oct 2024
16:00
L6

Solvability and Order Type for Finite Groups

Pawel Piwek
(University of Oxford)
Abstract

How much can the order type - the list of element orders (with multiplicities)—reveal about the structure of a finite group G? Can it tell us whether G is abelian, nilpotent? Can it always determine whether G is solvable? 

This last question was posed in 1987 by John G. Thompson and I answered it negatively this year. The search for a counterexample was quite a puzzle hunt! It involved turning the problem into linear algebra and solving an integer matrix equation Ax=b. This would be easy if not for the fact that the size of A was 100,000 by 10,000…

Mon, 02 Dec 2024
16:00
C3

TBC

Leo Gitin
(University of Oxford)
Abstract

TBC

Universal mean-field framework for SIS epidemics on networks, based on graph partitioning and the isoperimetric inequality
 Devriendt, K Van Mieghem, P (12 Jun 2017)
The Simplex Geometry of Graphs
 Devriendt, K Van Mieghem, P (17 Jul 2018)
Clustering for epidemics on networks: a geometric approach
 Prasse, B Devriendt, K Van Mieghem, P (25 Feb 2021)
Exploring the space of graphs with fixed discrete curvatures
 Roost, M Devriendt, K Zucal, G Jost, J (28 Feb 2024)
Graph curvature via resistance distance
 Devriendt, K Ottolini, A Steinerberger, S Discrete Applied Mathematics volume 348 68-78 (26 Jan 2024)
Unified mean-field framework for susceptible-infected-susceptible epidemics on networks, based on graph partitioning and the isoperimetric inequality.
 Devriendt, K Van Mieghem, P Physical review. E volume 96 issue 5-1 052314 (27 Nov 2017)
Pseudoinverse of the Laplacian and best spreader node in a network.
 Van Mieghem, P Devriendt, K Cetinay, H Physical review. E volume 96 issue 3-1 032311 (15 Sep 2017)
Effective resistance is more than distance: Laplacians, Simplices and the Schur complement
 Devriendt, K Linear Algebra and its Applications volume 639 24-49 (06 Jan 2022)
Subscribe to