Abstract

Speaker: Leah Gold, Texas A&M

Title: Cayley-Bacharach and Coding Theory

Abstract: Cohomological methods were used by J. Hansen to find a lower bound for the minimal distance of an evaluation code on a complete intersection in P^2. It can be shown that the bound has a natural generalization from P^2 to P^n. The proof is succinct and follows from an application of a modern version of the Cayley-Bacharach Theorem. This result is joint work with John Little (College of the Holy Cross) and Hal Schenck (Texas A&M University).