A central polynomial of an algebra A is a polynomial f in non-commutative variables that takes central values when evaluated in A. In case it vanishes in A, f is called a polynomial identities of A, otherwise f is a proper central polynomial of A. 

The purpose of this talk is to survey some old and new results on the growth of the spaces of central polynomials, proper central polynomials and polynomial identities of  an algebra  over a field of characteristic zero.

Profinite groups in which the centralizer of any non-identity element  is abelian (i.e., profinite CA-groups) are also known as profinite  commutativity-transitivity groups.

In this talk I shall present a dichotomy theorem obtained with  P. Shumyatsky and P. Zalesskii (2019, Israel J. Math, v. 230):  Any profinite CA-group has a finite index closed subgroup that  is either abelian or pro-p.

Given an extension L/K of number fields, we say that the Hasse norm principle (HNP) holds if every non-zero element of K which is a norm locally at every completion of K is in fact a global norm from L. If L/K is cyclic, the original Hasse norm theorem states that the HNP holds. More generally, there is a cohomological description (due to Tate) of the obstruction to the HNP for Galois extensions. 

In this series of three lectures, we will discuss two important and relatively new methods in combinatorics. Firstly, the probabilistic method developed by Erdős and which has now seen numerous applications in various areas of mathematics such as number theory, linear algebra, additive combinatorics, real analysis, as well as in computer science. Secondly, we will give an introduction to the polynomial method and present few surprising applications of linear algebra type-arguments to problems in combinatorics and geometry.

In this series of three lectures, we will discuss two important and relatively new methods in combinatorics. Firstly, the probabilistic method developed by Erdős and which has now seen numerous applications in various areas of mathematics such as number theory, linear algebra, additive combinatorics, real analysis, as well as in computer science. Secondly, we will give an introduction to the polynomial method and present few surprising applications of linear algebra type-arguments to problems in combinatorics and geometry.

The speaker will be presenting some of the results from his DPhil thesis (2017, University of Oxford). In particular, the talk will be centered on the problem of determining point-to-point reachability for discrete linear time-invariant dynamical systems, when the set of controls is either a convex polyhedron or a finite union of convex polyhedra. The speaker will present a proof that the latter case is undecidable, by encoding Hilbert's Tenth Problem; time permitting, a proof of hardness of the former case will also be presented.

Modular curves are moduli spaces of central importance in arithmetic geometry. In this talk, I will introduce these geometric objects and present some number theoretic results whose proofs used them in an essential way.

A gendo-symmetric algebra is the endomorphism ring of a generator over a symmetric algebra. After discussing various characterisations and examples, I will explain a comultiplication on these algebras.

This is joint work with Ming Fang.

The representation dimension of an algebra was introduced by Maurice Auslander in the 70's of the last century with the aim of measuring how far an algebra is to be representation-finite. Recall that an algebra A is representation finite provided there are only finitely many non-isomorphic indecomposable finitely generated A-modules.