English

On some polynomial version on the sum-product problem for subgroups

Combinatorics 2020-08-21 v1 Number Theory

Abstract

We generalize two results about subgroups of multiplicative group of finite field of prime order. In particular, the lower bound on the cardinality of the set of values of polynomial P(x,y)P(x,y) is obtained under the certain conditions, if variables xx and yy belong to a subgroup GG of the multiplicative group of the filed of residues. Also the paper contains a proof of the result that states that if a subgroup GG can be presented as a set of values of the polynomial P(x,y)P(x,y), where xAx\in A, and yBy\in B then the cardinalities of sets AA and BB are close (in order) to a square root of the cardinality of subgroup GG.

Keywords

Cite

@article{arxiv.2008.08684,
  title  = {On some polynomial version on the sum-product problem for subgroups},
  author = {Sofia Aleshina and Ilya Vyugin},
  journal= {arXiv preprint arXiv:2008.08684},
  year   = {2020}
}
R2 v1 2026-06-23T17:58:31.955Z