Mathematics Graduate Student Colloquium

Counting simultaneous core partitions

Hayan Nam
Monday, May 22, 2017
4:00 pm - 4:50 pm
RH340N

Talk Abstract:

A partition with no hook lengths divisible by a is called an a-core partition. For two coprime numbers a and b, a partition is called an (a,b)-core partition if it is both a-core and b-core partition. It is well-known that the number of a-core partitions is infinite, and Anderson proved the number of (a,b)-core partitions is a rational Catalan number. Inspired by work of Johnson, we give an expression for the number of (a,b,c)-core partitions. This is ongoing work with Jineon Baek and Myungjun Yu.

About the Speaker:

Hayan is a 3rd year phD student. Her main interests in math are number theory and combinatorics, especially counting problems and enumerative combinatorics. She likes hanging out with people, watching movies and musicals, and playing tennis.

Advisor and Collaborators

Professor Nathan Kaplan is Hayan's advisor.

Supplementary Materials:

none

Refreshments:

Pizza will be served after the talk.

Last Modified: October 19, 2018 at 4:17 AM (UTC)
Valid HTML 4.01 Strict