The area starts with Galois and Gauss. Group theory and
exponential sums were the two application areas then. That
tradition continues.
Research in finite fields requires combinatorial
understanding of many examples. This is true in myriad
applications coding theory exceptional polynomials
and covers, algorithmic applications of elimination of
quantiers, diophantine relations between curves over number fields and
their reductions modulo p,
probabilistic algorithms over finite fields.
Yet, there are powerful general abstract tools Consider two
premiere mathematical events from the last twenty five years.
This conference's papers offer examples of applying such tools to
practical researcher specialties. The sections of this preface
divide along the basic
themes of the conference. The preface makes several connections
not appearing directly in the papers Some papers in the
conference refer directly to Bernie
Dwork (who died not long after attending the conference), not
only to his papers. This preface's sections includes comments
giving an overview of his work. It compliments the
article N. Katz and J. Tate, B. Dwork
1923–1998, Notices of the AMS 46 3, 338–343.
§1. Beyond Weil
bounds curves with many rational points
§2. Monodromy groups of
characteristic p covers
§3. Zeta functions and
trace formulas
§4. A short dedication to
the work of Bernard Dwork