7.00PM
- 8.00PM

Speaker: Emeritus Professor Peter Rowlinson, University of Stirling

We ask what can, and what cannot, be counted by means of a formula. For example, the number of strings of 0s and 1s of length *n* is 2^{n}; but there are networks with *n* nodes for which we have no counting formula. We discuss links with tiling problems and colouring problems which arise in recreational mathematics. Expect to encounter some algebra!

This lecture is part of the *A Random Walk through Mathematics and Computing Science* series of public lectures organised by Computing Science and Mathematics, University of Stirling.

Further details are available here http://www.maths.stir.ac.uk/lectures/

Venue: Lecture Theatre B4, Cottrell Building, University of Stirling

RSVP: All welcome. No need to book a place in advance.