Anton A. Klyachko, Anna A. Mkrtchyan
Published 2012-05-13, updated 2014-05-24Version 6
Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the matrix composed of the exponent sums of i-th unknown in j-th equation is less than the number of unknowns. We generalise this result in two directions: first, we consider equations with coefficients, and secondly, we consider not only systems of equations but also any first-order formulae in the group language (with constants). Our theorem implies some amusing facts; for example, the number of group elements whose squares lie in a given subgroup is divisible by the order this subgroup.
Comments: With an appendix by D. V. Trushin, 9 pages. A Russian version of this paper is at http://mech.math.msu.su/department/algebra/staff/klyachko/papers.htm V3: a reference to Mathoverflow is added. V4: Corollary 5 is strengthened; the construction of the matrix $A(\phi)$ is clarified slightly. V5: The main theorem is strengthened; a corollary is added. V6: minor misprint correction
Journal: International Journal of Algebra and Computation, 2014, 24:4, 413-428
A generalization of the probability that the commutator of two group elements is equal to a given element
Compressed decision problems in hyperbolic groups
The conjugacy problem in hyperbolic groups for finite lists of group elements
![QR code for arXiv:1205.2824 [math.GR]](http://oss.arxitics.com/images/favicon.svg)