**Problem of the Week**

**Math Club**

**BUGCAT 2019**

**DST and GT Day**

**Number Theory Conf.**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

seminars:comb:abstract.200511bou

The Rogers-Ramanujan identities appear in many areas of mathematics, such as combinatorics, number theory, group theory, statistical physics, probability, and complex analysis. However, no very simple proof of them is known.

I will explain a way to prove generalizations of the Rogers-Ramanujan identities combinatorially by using two new bijections on partitions of an integer. These bijections are related to Dyson's notion of rank of a partition.

I will not assume any knowledge of the theory of integer partitions.

To the Combinatorics Seminar

seminars/comb/abstract.200511bou.txt · Last modified: 2020/01/29 14:03 (external edit)

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported