Seminars and Colloquia
Mathematics
The Chinese Reminder Theorem for Partitions
Thu, Jun 29, 2017,
03:00 PM to 04:00 PM
at Madhava Hall
Ojaswi Chaurasia and Seethalakshmi K
NIT Rourkela and IISER Pune
Given a positive integer n and a partition lambda, there is a notion of a `remainder of lambda upon division by n', called the n-core of lambda.
We have proven an analogue of the Chinese Remainder Theorem: Given m,n with d=gcd(m,n), an m-core mu and an n-core nu, there is a partition whose m-core is mu and whose n-core is nu iff the d-cores of mu and nu coincide. In this talk we introduce the topic, sketch our proof, and discuss the set of solutions. This is joint work with Ragini Balachander.
