Products of Differences in Prime Order Finite Fields

2016/02/05 by Giorgis Petridis, Petridis, Giorgis · 1 citation
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Coding theory and cryptography #Cryptography and Residue Arithmetic

paper · pdf · doi:10.48550/arxiv.1602.02142

Abstract

There exists an absolute constant C with the following property. Let A ⊆ \mathbbF_p be a set in the prime order finite field with p elements. Suppose that |A| > C p^5/8. The set (A ± A)(A ± A) = \(a₁ ± a₂)(a₃ ± a₄) : a₁,a₂,a₃,a₄ ∈ A\ contains at least p/2 elements.

Citations

• Group actions and geometric combinatorics in \mathbb F_q^d

Cited by

• Sum-Product Type Estimates for Subsets of Finite Valuation Rings

Related

• Additive properties of product sets in fields of prime order
• Additive properties of product sets in an arbitrary finite field
• An improved sum-product estimate over finite fields
• Difference sets are not multiplicatively closed
• On growth of the set A(A+1) in arbitrary finite fields