![Real Analysis in Computer Science_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Real%20Analysis%20in%20Computer%20Science_hi-res.jpg?h=e2b42a27&itok=jpgiJZrK)
Abstract
I will talk about two neoclassical results showing pseudorandom properties of some simple functions over finite fields of small characteristic (such as F_{2^n}). The first result shows that some functions over F_{2^n}, such as the cubic residue character and Trace(x^(1/3)), are uncorrelated with degree n^{0.1} polynomials over F_2. The theorems and proofs are related to the Razborov-Smolensky method for proving lower bounds on arithmetic circuits over F_2. The second result (joint with Eli Ben-Sasson) shows that some other functions, such as Trace(x^7), are nonconstant on subspaces of small dimension, provided F_{2^n} has no large subfields. The proof uses an algebraic expression of the sum-product phenomenon involving properties of "subspace polynomials."