No-three-in-a-line problems
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Joe Tomkinson.
Let S be a set in some vector space. What’s the largest subset of S with no three collinear points? This simple question (for various choices of S) has led to some interesting mathematics touching on a diverse range of subjects from combinatorial number theory to algebraic geometry. I will discuss some of these topics from an elementary viewpoint.
This talk is part of the The Archimedeans (CU Mathematical Society) series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|