For more information about this meeting, contact James Sellers, George Andrews, Matthew Katz.
| Title: | Congruences and Identities of Ramanujan Type |
|---|
| Seminar: | Combinatorics/Partitions Seminar |
|---|
| Speaker: | Silviu Radu, Research Institute for Symbolic Computation (RISC), Austria |
|---|
| Abstract: |
|---|
| In 1919 Ramanujan discovered the following congruences for p(n), the
number of partitions of n:
p(5n+4)=0 mod 5;
p(7n+5)=0 mod 7;
p(11n+6)=0 mod 11.
Since Ramanujan many other similar congruences have been discovered. Not
only the partition function enjoys such congruences but also other
sequences whose generating functions may be written in terms of simple
infinite products.
In this talk we give an algorithm to prove such congruences in general. We
will also give an algorithm that produces certain identities similar to
"Ramanujan's most beautiful identity" provided that certain assumptions
are satisfied. |
Room Reservation Information
| Room Number: | MB106 |
|---|
| Date: | 09 / 20 / 2011 |
|---|
| Time: | 11:15am - 12:05pm |
|---|
