Title: The constrained bipartite distinct distance problem
Speaker: Alex McDonald (OSU)
Speaker's URL: https://sites.google.com/view/alexmcdonaldmath/home
Abstract: The bipartite distinct distance problem asks, given two finite sets A and B in the plane, what is the minimum number of distances |a-b| between points in A and points in B. There are several interesting variants of this problem which have been studied, where one requires that A or B (or both) satisfy some algebraic constraint. I will give an overview of this class of problems, and present my work (joint with McDonald, Passant and Sahay) on the number of distances between sets under the assumption that one lies on a circle and the other is essentially arbitrary.
URL associated with Seminar: https://tgda.osu.edu/activities/tdga-seminar/
