Sponsored by the Rutgers University Department of Mathematics and the

Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)

**Co-organizers:****Andrew Baxter**, Rutgers University, baxter{at} math [dot] rutgers [dot] edu**Doron Zeilberger**, Rutgers University, zeilberg {at} math [dot] rutgers [dot] edu

Title: Illuminating Roth's Theorem (Informal Masters Defense)

Speaker: **David Wilson**, Rutgers University

Date: Thursday, April 21, 2011 5:00pm

Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ

Abstract:

When we read a paper, how deep do we read it? For my Masters Essay I looked at K. F. Roth's On certain sets of integers, a seminal paper in arithmetic combinatorics. In the paper, Roth proved his eponymous theorem and I worked through his proof, trying to make every single step clear. This expanded his terse 6 page paper into around 50 pages of explanation. I then tried to make his paper as clear as possible for future readers. To do this, I partnered the explanatory paper with a Maple package, Maple Maplet and online Wiki. I will demonstrate each of these elements of my Masters Project and talk about how this approach may be used in the future.