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

DOI10.1134/S0001434623010017arXiv2008.08684MaRDI QIDQ6347396FDOQ6347396

Authors: S. A. Aleshina, I. V. V'yugin 

Publication date: 19 August 2020

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

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Finite fields and commutative rings (number-theoretic aspects) (11T99)

This page was built for publication: On some polynomial version on the sum-product problem for subgroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6347396)