There are not too many magic configurations

Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


A finite planar point set P is called a magic configuration if there is an assignment of positive weights to the points of P such that, for everyline l determined by P, the sum of the weights of all points of P on l equals 1. We prove a conjecture of Murty from 1971 and show that a magic configuration consists either of points in general position, or all points are collinear, with the possible exception of one point, or they form a special configuration of 7 points.

Original languageEnglish
Title of host publicationProceedings of the Twenty-third Annual Symposium on Computational Geometry, SCG'07
Number of pages8
StatePublished - 2007
Externally publishedYes
Event23rd Annual Symposium on Computational Geometry, SCG'07 - Gyeongju, Korea, Republic of
Duration: 6 Jun 20078 Jun 2007

Publication series

NameProceedings of the Annual Symposium on Computational Geometry


Conference23rd Annual Symposium on Computational Geometry, SCG'07
Country/TerritoryKorea, Republic of


  • Discharging method
  • Magic configurations

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics


Dive into the research topics of 'There are not too many magic configurations'. Together they form a unique fingerprint.

Cite this