Distance-regular graphs

This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page

A new doubly discrete analogue of smoke ring flow and the real time simulation of fluid flow

Modelling incompressible ideal fluids as a finite collection of vortex filaments is important in physics (super-fluidity, models for the onset of turbulence) as well as for numerical algorithms used in computer graphics for the real time simulation of smoke. Here we introduce a time-discrete evolution equation for arbitrary closed polygons in 3-space that is a discretisation of the localised induction approximation of filament motion. This discretisation shares with its continuum limit the property that it is a completely integrable system. We apply this polygon evolution to a significant improvement of the numerical algorithms used in Computer Graphics.Comment: 15 pages, 3 figure

Periodic boundary conditions on the pseudosphere

We provide a framework to build periodic boundary conditions on the pseudosphere (or hyperbolic plane), the infinite two-dimensional Riemannian space of constant negative curvature. Starting from the common case of periodic boundary conditions in the Euclidean plane, we introduce all the needed mathematical notions and sketch a classification of periodic boundary conditions on the hyperbolic plane. We stress the possible applications in statistical mechanics for studying the bulk behavior of physical systems and we illustrate how to implement such periodic boundary conditions in two examples, the dynamics of particles on the pseudosphere and the study of classical spins on hyperbolic lattices.Comment: 30 pages, minor corrections, accepted to J. Phys.

Newton polygons and curve gonalities

We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number of special cases. One proof technique uses recent work of M. Baker on linear systems on graphs, by means of which we reduce our conjecture to a purely combinatorial statement.Comment: 29 pages, 18 figures; erratum at the end of the articl