The sovability of norm, bilinear and quadratic equations over finite fields via spectra of graphs

2009/04/02 by Le Anh Vinh, Vinh, Le Anh · 2 citations
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT) #math.CO #math.NT

paper · pdf · doi:10.48550/arxiv.0904.0441

28 pages

arxiv created 2009/04/02 · arxiv updated 2009/12/01

Abstract

In this paper we will give a unified proof of several results on the sovability of systems of certain equations over finite fields, which were recently obtained by Fourier analytic methods. Roughly speaking, we show that almost all systems of norm, bilinear or quadratic equations over finite fields are solvable in any large subset of vector spaces over finite fields.

Cited by

• Additive structures imply more distances in \mathbbF_q^d
• Distribution of simplices in the discrete and continuous settings

Related

• On The Solvability of Bilinear Equations in Finite Fields
• On the solvability of systems of bilinear equations in finite fields
• On diagonal equations over finite fields via walks in NEPS of graphs
• On diagonal equations over finite fields
• Solution Theory for Systems of Bilinear Equations