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 is obtained under the certain conditions, if variables and belong to a subgroup of the multiplicative group of the filed of residues. Also the paper contains a proof of the result that states that if a subgroup can be presented as a set of values of the polynomial , where , and then the cardinalities of sets and are close (in order) to a square root of the cardinality of subgroup .
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}
}