On the number of tuples of group elements satisfying a first-order formula

Abstract

Our result contains as special cases the Frobenius theorem (1895) on the~number of solutions to the equation $x^n=1$ in a finite group and the Solomon theorem (1969) on the number of solutions in a group to systems of equations with fewer equations than unknowns. Instead of systems of equations, we consider arbitrary first-order formulae in the group language with constants. Our result substantially generalizes the Klyachko--Mkrtchyan theorem (2014) on this topic.

arXiv admin note: text overlap with arXiv:1806.08870