Tag Archives: Chevalley’s theorem on constructible sets

This workshop was on “Computational and algorithmic aspects” (of groups, representations and applications, presumably). In my opinion, this was the week when the programme really took off. There were many good talks, so as ever I shall just select a … Continue reading →