In 1878, Jordan showed that there is a function f on the set of natural numbers such that, if $G$ is a finite subgroup of $GL(n,C)$, then $G$ has an abelian normal subgroup of index at most $f(n)$. Early bounds were given by Frobenius and Schur, and close to optimal bounds were given by Weisfeiler in unpublished work in 1984 using the classification of finite simple groups; about ten years ago I obtained the optimal bounds. Crucially, these are "absolute" bounds; they do not address the wider question of divisibility of orders.

In 1887, Minkowski established a bound for the order of a Sylow p-subgroup of a finite subgroup of GL(n,Z). Recently, Serre asked me whether I could obtain Minkowski-like results for complex linear groups, and posed a very specific question. The answer turns out to be no, but his suggestion is actually quite close to the truth, and I shall address this question in my seminar. The answer addresses the divisibility issue in general, and it turns out that a central technical theorem on the structure of linear groups from my earlier work which there was framed as a replacement theorem can be reinterpreted as an embedding theorem and so can be used to preserve divisibility.

We hope to bring together all Oxford researchers interested in Cryptography, in Quantum Computing and in the interactions between the two.

Please register at:  http://oxford-cryptography-day.eventbrite.co.uk

Orientable manifolds can only have an odd Euler characteristic in dimensions divisible by 4. I will prove the analogous result for spin and string manifolds, where the dimension can only be a multiple of 8 and 16 respectively. The talk will require very little background. I'll go over the definition of spin and string structures, discuss cohomology operations and Poincare duality.

Structure-preserving signatures are an important cryptographic primitive that is useful for the design of modular cryptographic protocols. In this work, we show how to bypass most of the existing lower bounds in the most efficient Type-III bilinear group setting. We formally define a new variant of structure-preserving signatures in the Type-III setting and present a number of fully secure schemes with signatures half the size of existing ones. We also give different constructions including constructions of optimal one-time signatures. In addition, we prove lower bounds and provide some impossibility results for the variant we define. Finally, we show some applications of the new constructions.