12/03/2013 - 12:15pm

12/03/2013 - 1:10pm

Speaker:

Matthias Beck (San Francisco State University)

Abstract:

The study of partitions and compositions (i.e., ordered partitions) of integers goes back centuries and has applications in various areas within and outside of mathematics. Partition analysis is full of beautiful -- and sometimes surprising -- identities, starting with Euler's classic theorem that the number of partitions of an integer k into odd parts equals the number of partitions of k into distinct parts. Motivated by work of G. Andrews et al from the last 1 1/2 decades, we will show how one can shed light on certain classes of partition identities by interpreting partitions as integer points in polyhedra. Our approach yields both "short" proofs of known results and new theorems. This is joint work with Ben Braun, Ira Gessel, Nguyen Le, Sunyoung Lee, and Carla Savage.

Where:

Mudd Science Library 126, Pomona College

__Claremont Graduate University__ | __Claremont McKenna__ | __Harvey Mudd__ | __Pitzer__ | __Pomona__ | __Scripps__

Proudly Serving Math Community at the Claremont Colleges Since 2007

Copyright © 2018 Claremont Center for the Mathematical Sciences