About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
CCCG 2007
Conference paper
An improved bound for the affine sylvester problem
Abstract
In 2006, Lenchner and Brönnimann showed that in the affine plane, given n lines, not all parallel and not all passing through a common point, there had to be at least n/6 ordinary points. The present paper improves on this result to show that there must be at least 2n-3/7 ordinary points, except for a single arrangement of 6 lines with one ordinary point.