The Polynomially Generated Powers Property, and Quantified Constraint Satisfaction
Hubie Chen, UPF Barcelona

The polynomially generated powers (PGP) property is a combinatorial property on algebras; an algebra A has this property if A^n has polynomially sized generating sets (in n).  This property was introduced with the motivation of understanding the complexity of quantified constraint satisfaction, but is a natural algebraic property in its own right.  In this talk, I will give an overview of what is known about both this property and how it interacts with the complexity of quantified constraint satisfaction.