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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

The self-avoiding walk problem

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Dixon / Greaves Room, Department of Pathology, Tennis Court Road The Lord Ashcroft International Business School Anglia Ruskin University East Road<br /> CB1 1PT Cambridge United Kingdom Rooms SG1 & SG2, Alison Richard Building, 7 West Road, Cambridge, CB3 9DT

Other talks

Group Work The spread of environmental cost-benefit analysis in UK government, c.1966-1995: representing the public in the Anthropocene Title to be confirmed TBC Synthesizing Diverse Policies for Multi-Agent Coordination Title to be confirmed
 

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