Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, and
There are not too many magic configurations
- In: Proceedings of the 23rd Annual Symposium on Computational
Geometry, Gyeongju, South Korea, June 6-8, 2007. Association
for Computing Machinery, 2007, pp. 142-149. doi:10.1145/1247069.1247098
- Discrete and Computational Geometry 39 (2008), pp. 3-16.
A finite planar point set P is called a magic configuration
there is an assignment of positive weights to the points of P
such that, for every line l determined by P,
the sum of
the weights of all points of P on l equals 1.
a conjecture of Murty from 1971 and show that a magic configuration
either of points in general position, or all points are collinear, with
possible exception of one point, or they form a special configuration
free PDF view@Springer
Last update: August 14, 2017.