There are not too many magic configurations

E. Ackerman, K. Buchin, C. Knauer, R. Pinchasi, G. Rote

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

Abstract

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 23rd Annual ACM Symposium on Computational Geometry (SoCG 2007) 6-8 June 2007, Geongju, South Korea
Place of PublicationNew York
PublisherAssociation for Computing Machinery, Inc
Pages142-149
ISBN (Print)978-1-59593-705-6
DOIs
Publication statusPublished - 2007
Event23rd International Symposium on Computational Geometry (SoCG 2007) - Gyeongju, Korea, Republic of
Duration: 6 Jun 20078 Jun 2007
Conference number: 23

Conference

Conference23rd International Symposium on Computational Geometry (SoCG 2007)
Abbreviated titleSoCG 2007
CountryKorea, Republic of
CityGyeongju
Period6/06/078/06/07

Fingerprint

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

Cite this