Short Laws for Finite Groups and Residual Finiteness Growth
Abstract
A law for a group G is a non-trivial equation satisfied by all tuples of elements in G. We study the length of the shortest law holding in a finite group. We produce new short laws holding (a) in finite simple groups of Lie type and (b) simultaneously in all finite groups of small order. As an application of the latter we obtain a new lower bound on the residual finiteness growth of free groups. This talk is based on joint work with Andreas Thom.
14:00
Falcon: Compact lattice-based signatures based on the hash & sign paradigm
Abstract
Post-quantum cryptography has been one of the most active subfields of
cryptography in the last few years. This is especially true today as
standardization efforts are currently underway, with no less than 69
candidate cryptographic schemes proposed.
In this talk, I will present one of these schemes: Falcon, a signature
scheme based on the NTRU class of structured lattices. I will focus on
mathematical aspects of Falcon: for example how we take advantage of the
algebraic structure to speed up some operations, or how relying on the
most adequate probability divergence can go a long way in getting more
efficient parameters "for free". The talk will be concluded with a few
open problems.
There have been reports in the press this week of how the examination length for students taking examinations in the Mathematical Institute at the University of Oxford was extended in summer 2017.
We would like to emphasise that the extension was applied to all students taking those examinations and was for academic reasons. This is part of an ongoing review of our examination processes.
What's new in moonshine? CANCELLED
Abstract
The so-called moonshine phenomenon relates modular forms and finite group representations. After the celebrated monstrous moonshine, various new examples of moonshine connection have been discovered in recent years. The study of these new moonshine examples has revealed interesting connections to K3 surfaces, arithmetic geometry, and string theory. In this colloquium I will give an overview of these recent developments.
16:00
Permuting F_q using a density method
Abstract
The construction of permutation functions of a finite field is a task of great interest in cryptography and coding theory. In this talk we describe a method which combines Chebotarev density theorem with elementary group theory to produce permutation rational functions over a finite field F_q. Our method is entirely constructive and as a corollary we get the classification of permutation polynomials up to degree 4 over any finite field of odd characteristic.
This is a joint work with Andrea Ferraguti.
Oxford Mathematician Dan Ciubotaru talks about his recent research in Representation Theory.
The critical threshold for Bargmann-Fock percolation
Abstract
Let f be the planar Bargmann-Fock field, i.e. the analytic Gaussian field with covariance kernel exp(-|x-y|^2/2). We compute the critical point for the percolation model induced by the level sets of f. More precisely, we prove that there exists a.s. an unbounded component in {f>p} if and only if p<0. Such a percolation model has been studied recently by Beffara-Gayet and Beliaev-Muirhead. One important aspect of our work is a derivation of a (KKL-type) sharp threshold result for correlated Gaussian variables. The idea to use a KKL-type result to compute a critical point goes back to Bollobás-Riordan. This is joint work with Alejandro Rivera.
15:00
Full orbit sequences in affine spaces
Abstract
Let n be a positive integer. In this talk we provide a recipe to
construct full orbit sequences in the affine n-dimensional space over a
finite field. For n=1 our construction covers the case of the well
studied pseudorandom number generator ICG.
This is a joint work with Federico Amadio Guidi.