Distance sets over arbitrary finite fields
Doowon Koh, Sujin Lee, Thang Pham, Chun‐Yen Shen
Abstract
Open-access reader
Doowon Koh, Sujin Lee, Thang Pham, Chun‐Yen Shen
Abstract
Open-access reader
In this paper, we study the Erdős distinct distances problem for Cartesian product sets in the setting of arbitrary finite fields. More precisely, let Fq be an arbitrary finite field and A be a set in Fq. Suppose |A∩(aG)|≤|G|1/2 for any subfield G and a∈Fq∗, then |ΔFq(A2)|=|(A−A)2+(A−A)2|≫|A|1+121. Using the same method, we also obtain some results on sum–product type problems.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we study the Erdős distinct distances problem for Cartesian product sets in the setting of arbitrary finite fields. More precisely, let Fq be an arbitrary finite field and A be a set in Fq. Suppose |A∩(aG)|≤|G|1/2 for any subfield G and a∈Fq∗, then |ΔFq(A2)|=|(A−A)2+(A−A)2|≫|A|1+121. Using the same method, we also obtain some results on sum–product type problems.
Key concepts: Cartesian product, Mathematics, Finite field, Product (mathematics), Set (abstract data type), Finite set, Field (mathematics), Cartesian coordinate system