David G Larman, PhD, DSc
Emeritus Professor and Part-time Teaching Fellow

My current research interests lie in the areas of geometry, analysis and combinatorics.  Recent results include showing that the blocking number for a four-dimensional ball is nine and that the convex hull of the lattice points within an n-dimensional ball behave as if the same number of points were distributed at random i.e. they have (essentially) the average number of vertices, facets, etc.

One important problem is to decide whether it is possible to always find a path of edges between any two vertices of a d-dimensional polytope which never re-visits any facet of the polytope.  If true, this would have considerable implications for finding good algorithms for linear programming problems.

This page was last modified on April 15, 2011 by Helen Higgins