Combinatorics, Number Theory, and Symbolic Analysis

Description

Partition numbers $p(n)$ give the number of additive decompositions of nonnegative integers. For example, $4=3+1=2+2=2+1+1=1+1+1+1$, so $p(4)=5$. Ramanujan observed that all numbers $p(5n+4)$, $n\geq 0$, are divisible by 5. Recently, in the context of modular forms, Silviu Radu (RISC) has set up an algorithmic machinery to prove such congruences automatically. The talk is about new developments in this area and discusses various connections between combinatorics, number theory, and symbolic analysis.

Period	16 Dec 2014
Event title	FoCM 2014, workshop: Symbolic Analysis
Event type	Conference
Location	UruguayShow on map