Structure and Randomness for Finite-field Polynomials are Almost Equivalent

Explore a mathematics seminar that delves into the relationship between structure and randomness in finite-field polynomials. Learn how systems of polynomial equations over finite fields behave when their solutions deviate from random systems, and discover how polynomials with biased derivatives relate to lower-degree polynomials. Examine the partition versus analytic rank conjecture for tensors and its recent proof involving a logarithmic factor. Understand the concept of "local rank," a novel combinatorial notion of tensor rank introduced as a powerful tool for analyzing higher-degree polynomials. Requiring only basic linear algebra knowledge, investigate applications in number theory, additive combinatorics, and coding theory through this collaborative research presented by Guy Moshkovitz from the City University of New York in partnership with Daniel Zhu.