$ n $-Cats-in-a-Bed Problem: Picking $ n $ points in a given planar domain to maximize the sum of their pairwise distances
mathoverflow.net/questions/198221/n-cats-in-a-bed-problem-picking-n-points-in...
Let $ C $ be a connected and simply connected compact subset of the plane $ \mathbb{R}^{2} $. How can we pick $ n $ points, denoted $ x_{1},\ldots,x_{n} $, lying in $ C $ such that the total sum $
Comments (0)
Sign in to post comments.