Abstract
In this paper we study the generalized Erdős–Falconer distance problems in the finite field setting via spectra of directed graph. The generalized distances are defined in terms of polynomials, and various formulas for sizes of distance sets are obtained. In particular, we give graph-theoretic proofs for various results due to Koh and Shen (2011). As a consequence, we also obtain a better bound under a weaker condition of the restricted sets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
