The talk this week is by Nicholas Smoot from the Research Institute of Symbolic Computation (RISC) at Johannes Kepler University (JKU), Linz, Austria. The announcement is below.
Talk Announcement:
Tea or Coffee: Please bring your own.
Abstract:
Since Ramanujan's groundbreaking work, a large variety of infinite congruence families for partition functions modulo prime powers have been discovered. These families vary enormously with respect to the difficulty of proving them. We will discuss the application of the localization method to proving congruence families by walking through the proof of one recently discovered congruence family for the counting function for 5-elongated plane partitions. In particular, we will discuss a critical aspect of such proofs, in which the associated generating functions of a given congruence family are members of the kernel of a certain linear mapping to a vector space over a finite field. We believe that this approach holds the key to properly classifying congruence families.
No comments:
Post a Comment