Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Logic and Algorithms in Group Theory - Trimester Program

Hausdorff Center for Mathematics via YouTube

Overview

Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore advanced topics in group theory through this comprehensive lecture series from the Hausdorff Center for Mathematics' trimester program on Logic and Algorithms in Group Theory. Delve into cutting-edge research areas including pseudofinite groups with Dugald Macpherson's three-part series, representation theory for groups of Lie type presented by Gerhard Hiss, and algorithmic approaches to finitely presented groups covered by Derek Holt. Examine stability theory and invariant random subgroups through Andreas Thom's lectures, and investigate non-commutative algebraic geometry with Zlil Sela's foundational work. Study amenable theories, Burnside groups of small odd exponent, growth phenomena in linear algebraic and permutation groups, and forking independence in free groups. Learn about first-order rigidity in high-rank arithmetic groups, group isomorphism problems, equations in groups and their connections to formal languages, relational complexity of finite permutation groups, and properties of small profinite groups. Discover arboreal structures and Poisson boundaries, computational methods for infinite linear groups, scale computation techniques, and applications of small cancellation theory to rings, concluding with model-theoretic approaches to rigidity in ergodic theory.

Syllabus

Dugald Macpherson: Pseudofinite groups I
Dugald Macpherson: Pseudofinite groups II
Dugald Macpherson: Pseudofinite groups III
Gerhard Hiss: Representation theory for groups of Lie type II
Gerhard Hiss: Representation theory for groups of Lie type III
Gerhard Hiss: Representation theory for groups of Lie type I
Derek Holt: Algorithms for finitely presented groups III
Derek Holt: Algorithms for finitely presented groups II
Derek Holt: Algorithms for finitely presented groups I
Andreas Thom: Stability and invariant random subgroups III
Andreas Thom: Stability and invariant random subgroups I
Andreas Thom: Stability and invariant random subgroups II
Zlil Sela: Basic conjectures and preliminary results in non commutative algebraic geometry
Krzysztof Krupinski: Amenable theories
Katrin Tent: Burnside groups of relatively small odd exponent
Harald Andres Helfgott: Growth in linear algebraic groups and permutation groups ......
Chloe Perin: Forking independence in the free group
Alex Lubotzky: First order rigidity of high rank arithmetic groups
James Wilson: Distinguishing Groups and the Group Isomorphism problem
Laura Ioana Ciobanu Radomirovic: Equations in groups, formal languages and complexity
Gregory Cherlin: The Relational Complexity of a Finite Permutation Group
Dan Segal: Small profinite groups
Anna Erschler: Arboreal structures, Poisson boundary and growth of Groups
Alla Detinko: Computing with infinite linear groups methods, algorithms, and applications
George Willis: Computing the scale
Alan Reid: Distinguishing certain triangle groups by their finite quotients
Agatha Atkarskaya: Towards a Group like Small Cancellation Theory for Rings
Todor Tsankov: A model theoretic approach to rigidity in ergodic theory

Taught by

Hausdorff Center for Mathematics

Reviews

Start your review of Logic and Algorithms in Group Theory - Trimester Program

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.