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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

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.

Other lists

Economic and Social History Seminars CMS Events Adolescence: rhetoric, representations, realities discussion group Cafe Synthetique Philosophy and History of Science Plant Sciences Research Seminars

Other talks

Anthropology, mass graves and the politics of the dead 160 years of occupational structure: Late Imperial China and its regions Michael Alexander Gage and the mapping of Liverpool, 1828–1836 Political Thought, Time and History: An International Conference
 

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