Speaker:  Dan Ashlock (UoG)

Abstract: A point packing is a placement of points in a, usually finite, space with a minimum distance constraint.  The goal is to place as many points as possible in the space while obeying the minimum distance constraint.  Examples of point packings include error correcting codes which are ubiquitous in communications.  In this talk we will look at techniques for creating point packings and applications of point packing from creating contrasting sets of colors, a super-fast clustering algorithm, and the efficient transformation genetic data into points in Euclidean space.