Event Type:

Number Theory Seminar

Date/Time:

Tuesday, February 7, 2017 - 16:00 to 17:00

Location:

Bexell 417

Abstract:

The partition crank function was developed to give a combinatorial proof of the Ramanujan congruences. Two variants of the crank have been studied for overpartitions, a generalization of partitions. We introduce an infinite family, the d-th residual cranks, and extend some known inequalities.