Finite fields, codes and quasirandomness

Document Type

Presentation Abstract

Presentation Date



A classical problem considered by Davenport asks for the number of occurrences of a certain pattern of quadratic residues and nonresidues among the set of integers modulo a prime p. We will take this problem as a starting point of an itinerary revealing the interplay between quasirandom structures over finite fields, definable subsets of finite fields, character sums and coding theory.

Additional Details

Thursday, October 23, 1997
4:10 p.m. in MA 109
Coffee/Tea/Treats 3:30 p.m. in MA 104 (Lounge)

This document is currently not available here.