N1qjl4ea4ljzensnocnr
SkillsCast

Generalized Rogers-Ramanujan bijections

7th December 2015 in London at CodeNode

There are 1 other SkillsCast available from Mersenne Primes and Rogers-Ramanujan Bijections

Bijections are mappings from sets onto themselves. Some bijections in combinatorial number theory can be defined iteratively, but not (it seems) in an explicit closed form. I will explore one such bijection that can be expressed neatly as an algorithm.

YOU MAY ALSO LIKE:

Thanks to our sponsors

Generalized Rogers-Ramanujan bijections

Paul Hammond

Paul is a mathematics tutor at the University of Brighton International College. He has a DPhil from the University of Sussex, and was partly responsible for the invention of (what is now known as) the Hammond-Lewis birank.

SkillsCast

Bijections are mappings from sets onto themselves. Some bijections in combinatorial number theory can be defined iteratively, but not (it seems) in an explicit closed form. I will explore one such bijection that can be expressed neatly as an algorithm.

YOU MAY ALSO LIKE:

Thanks to our sponsors

About the Speaker

Generalized Rogers-Ramanujan bijections

Paul Hammond

Paul is a mathematics tutor at the University of Brighton International College. He has a DPhil from the University of Sussex, and was partly responsible for the invention of (what is now known as) the Hammond-Lewis birank.