Solutions of equations over finite fields: enumeration via bijections
Abstract
We present a simple proof of the well-known fact concerning the number of solutions of diagonal equations over finite fields. In a similar manner, we give an alternative proof of the recent result on generalizations of Carlitz equations. In both cases, the use of character sums is avoided by using an elementary combinatorial argument.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.