Finite fields, codes and quasirandomness

Authors

Dr. Mihai Caragiu, Department of Mathematics, Washington State University

Document Type

Presentation Abstract

Presentation Date

10-23-1997

Abstract

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)

Recommended Citation

Caragiu, Dr. Mihai, "Finite fields, codes and quasirandomness" (1997). Colloquia of the Department of Mathematical Sciences. 7.
https://scholarworks.umt.edu/mathcolloquia/7