When

Start: 09/28/2016 - 4:15pm

End : 09/28/2016 - 5:15pm

End : 09/28/2016 - 5:15pm

Category

Colloquium

Speaker

Igor Pak (UCLA)

Abstract

Integer sequences arise in a large variety of combinatorial problems as a way to count combinatorial objects. Some of them have nice formulas, some have elegant recurrences, and some have nothing interesting about them at all. Can we characterize when? Can we even formalize what is a "formula"? I will give a mini-survey aiming to answer these question with many examples. At the end, I will present some recent results counting certain permutation classes, and finish with open problems.

Where

Kravis Center Lower Court 62, Claremont McKenna 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