Talk Abstract
In the September 2013 issue of Math Horizons Gary Gordon posed the following problem:
For a finite set of points in the plane, write down the following data: For each point P, record the number of 3-point lines through P, the number of 4-point lines through P, and so on. Is there a finite set of points in the plane where each point has a unique nonempty address?
Stan Wagon posted this same problem in the Macalester Problem of the Week forum. We use geometric representations of matroids to find the minimal solution to this problem. Then through construction identify a class of matroids with the property of unique addresses.
For a finite set of points in the plane, write down the following data: For each point P, record the number of 3-point lines through P, the number of 4-point lines through P, and so on. Is there a finite set of points in the plane where each point has a unique nonempty address?
Stan Wagon posted this same problem in the Macalester Problem of the Week forum. We use geometric representations of matroids to find the minimal solution to this problem. Then through construction identify a class of matroids with the property of unique addresses.
Talk Subject
Combinatorics
Time Slot
2016-04-02T14:45:00
Room Number
STAG 161