2020/08/19 by Sofia Aleshina, Aleshina, Sofia, Il'ya Vladimirovich Vyugin +1
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Mathematics #Finite Group Theory Research #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2008.08684
openalex publication_date 2020/08/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 x∈ A, and y∈ B then the cardinalities of sets A and B are close (in order) to a square root of the cardinality of subgroup G.