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

Source: [On the number of tuples of group elements satisfying a first-order formula](<https://www.sota2.com/research/paper/68fa5c6f1e209131ce9d0dc0>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T17:37:24.753Z

Authors: Elena K. Brusyanskaya

Published: 2023-06-28T18:47:52.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2306.16498>)

[PDF](<https://arxiv.org/pdf/2306.16498.pdf>)
