Home
 
Participants
 
Program
 
Local Information
 
Registration
 
Contact us
 
  General Description
The conference will be held from June 9th through June 13th 2025 at the Stevens Institute of Technology. Group theory, computability and algorithms have been inextricably intertwined since the fundamental papers of Max Dehn. The basis of all undecidability results in group theory and topology is the unsolvability of the word problem for finitely presented groups. There are many close links between group theory and automata theory and logic. The asymptotic-generic point of view of geometric group theory has recently led to new ideas in computational complexity and the theory of computability. This conference will explore several aspects of these connections and will have one day devoted to the use of AI in group theoretic research.

The conference will serve as the GAGTA 2025 in the GAGTA (Geometric and Asymptotic Group Theory with Applications) series of conferences and will pay tribute to A. Miasnikov.

  Sponsors:
The conference is generously supported by the Department of Mathematical Sciences at Stevens Institute of Technology.
NSF

  Speakers:
 •  Mikheil Amaglobelli (Tbilisi State University)
 •  Simon Andre (Institute of Mathematics of Jussieu - Paris Rive Gauche)
 •  Laurent Bartholdi (Saarland University), Schupp Lecture speaker
 •  Tengiz Bokelavadze (Tsereteli State University)
 •  Elena Bunina (Bar-Ilan University)
 •  Montserrat Casals-Ruiz (University of the Basque Country)
 •  Laura Ciobanu★ (Harriot Watt University)
 •  Evelina Danyarova (Sobolev Institute of Mathematics, Omsk)
 •  Volker Diekert (University of Stuttgart)
 •  Andrew Duncan★ (Newcastle University)
 •  Murray Elder (University of Technology Sydney)
 •  Rostislav Grigorchuk (Texas A&M)
 •  Mikhael Gromov (NYU)
 •  Vincent Guirardel (University of Rennes 1)
 •  Sergei Gukov (Caltech)
 •  Ilya Kapovich (Hunter College of CUNY)
 •  Ilya Kazachkov (University of the Basque Country)
 •  Bakhadyr Khoussainov (UESTC)
 •  Markus Lohrey (University of Siegen)
 •  Alexander Olshanski★ (Vanderbilt University)
 •  Denis Osin (Vanderbilt University)
 •  Eugene Plotkin (Bar-Ilan University)
 •  Tim Riley (Cornell University)
 •  Nikolai Romanovskii (Sobolev Institute of Mathematics, Novosibirsk)
 •  Ivan Shestakov (University of Sao Paulo)
 •  Vladimir Shpilrain (City College of CUNY)
 •  Rizos Sklinos (Chinese Academy of Sciences)
 •  Rachel Skipper (University of Utah)
 •  Tatiana Smirnova-Nagnibeda (University of Geneva)
 •  Ben Steinberg (City College of CUNY)
 •  Alexander Ushakov (Stevens Institute of Technology)
 •  Alina Vdovina (City College of CUNY)
 •  Pascal Weil (LaBRI)
 •  Armin Weiss★ (University of Stuttgart)
 •  Efim Zelmanov (SUSTech)
 ★  - to be confirmed

  Organizing committee:
 • Jan Cannizzo (Stevens Institute of Technology)
 • Montse Casals-Ruiz (University of the Basque Country)
 • Bob Gilman (Stevens Institute of Technology)
 • Olga Kharlampovich (Hunter College of CUNY)
 • Alexei Miasnikov (Stevens Institute of Technology)
 • Andrey Nikolaev (Stevens Institute of Technology)
 • Mahmood Sohrabi (Stevens Institute of Technology)
 • Sasha Ushakov (Stevens Institute of Technology)
 • Alex Taam (Stevens Institute of Technology)
 • Alina Vdovina (City College of CUNY)