University of Cambridge > Talks.cam > The Archimedeans (CU Mathematical Society) > The self-avoiding walk problem

The self-avoiding walk problem

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Joe Tomkinson.

How many n-step self-avoiding walks exist on a given infinite graph? This question is easy to state but notoriously hard to answer. I will describe the history of the problem, and will summarise progress and open questions, one of which may seem quite elementary.

This talk is part of the The Archimedeans (CU Mathematical Society) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity