Equations with constraints in virtually abelian groups

Abstract: The Diophantine problem in a group G is the decision problem asking whether there is an algorithm that decides if a system of equations in G admits a solution. When considering equations in groups, one can also add 'constraints' to the variables, such as insisting a specific variable must lie in a specific subgroup. We consider the Diophantine problem for virtually abelian groups, which has long been considered 'folklore'. We look at adding various types of constraints to equations in virtually abelian groups.

Mathematics

Audience: researchers in the topic

ANTLR seminar

Series comments: This is the Algebra, Number Theory, Logic and Representation theory seminar.