Alladi Ramakrishnan Hall

On certain algebraic and algorithmic questions about solvable Baumslag-Solitar groups

Oorna Mitra

IISER Kolkata

In the first part of the talk, I will introduce certain algorithmic problems in group theory—namely, the Twisted Conjugacy Problem (TCP) and Orbit Decidability (OD)—which are closely related to the classical Conjugacy Problem (CP). I will then present some recent results addressing the CP in specific extensions of solvable Baumslag–Solitar (BS) groups, based on joint work with Mallika Roy and Enric Ventura.

In the second part, I will discuss some new algebraic and algorithmic results concerning fixed point subgroups of solvable BS groups. This part is based on ongoing joint work with Ramya Nair.