Fri, 09 May 2025
16:00
L1

Fridays@4 – From research to market: lessons from an academic founder

Professor Ali El Kaafarani and Sami Walter
Abstract

Please join us for a fireside chat, hosted by OSE, between PQShield founder and visiting professor, Dr Ali El Kaafarani, and Sami Walter, associate at Oxford Sciences Enterprises (OSE). 

Dr Ali El Kaafarani is the founder and CEO of PQShield, a post-quantum cryptography (PQC) company empowering organisations, industries and nations with quantum-resistant cryptography that is modernising the vital security systems and components of the world's technology supply chain.  

In this chat, we’ll discuss Dr Ali El Kaafarani’s experience founding PQShield and lessons learned from spinning a company out from the Oxford ecosystem.

Mon, 26 May 2025

13:00 - 14:00

Mathematrix: Crafts and Chill

Abstract

It’s a busy and stressful term for a lot of us so come and take a break and do some colouring and origami with us. Venting is very much encouraged.

Algebraically hyperbolic groups
Kielak, D Logan, A Gardam, G Groups, Geometry, and Dynamics
Mon, 16 Jun 2025
16:00
C3

TBC

Charlotte Clare-Hunt
(University of Oxford)
Abstract

TBC

Mon, 09 Jun 2025
16:00
L6

TBC

Alexandra Kowalska
(Univesity of Oxford)
Abstract

TBC

Mon, 02 Jun 2025
16:00
L6

TBC

Anubhab Ghosal
(University of Oxford)
Abstract

TBC

Mon, 26 May 2025
16:00
L6

TBC

Vishal Gupta
(University of Oxford)
Abstract

TBC

Mon, 12 May 2025
16:00
L6

The moduli space of Bohr sets in R^n

Yaël Dillies
(Stockholm University)
Abstract

The arithmetic regularity lemma says that any dense set A in F_p^n can be cut along cosets of some small codimension subspace H <= F_p^n such that on almost all cosets of H, A is either random or structured (in a precise quantitative manner). A standard example shows that one cannot hope to improve "almost all" to "all", nor to have a good quantitative dependency between the constants involved. Adding a further combinatorial assumption on A to the arithmetic regularity lemma makes its conclusion so strong that one can essentially classify such sets A. In this talk, I will use use the analogous problem with F_p^n replaced with R^n as a way the motivate the funny title.

Subscribe to