For more information about this meeting, contact Mary Anne Raymond.
| Title: | The Ehrenpreis Rogers-Ramanujan Problem Revisited |
|---|
| Seminar: | Combinatorics/Partitions Seminar |
|---|
| Speaker: | George Andrews, Penn State |
|---|
| Abstract: |
|---|
| The late Leon Ehrenpreis asked in 1987 if one could prove that the number of partitions of n into parts congruent to 1 or 4 mod 5 is always at least as large as the number with parts congruent to 2 or 3 mod 5 WITHOUT using the Rogers-Ramanujan identities. Subsequently Baxter and I gave a "sort of" solution to the problem, and Kevin Kadell gave a complete solution in 1999. In this talk I will give some of the history and discuss a new method for dealing with such problems. |
Room Reservation Information
| Room Number: | MB106 |
|---|
| Date: | 12 / 07 / 2010 |
|---|
| Time: | 11:15am - 12:05pm |
|---|
