The upper-bound conjecture for construction lines determined by registration marks

Let k3k\geq 3 registration marks be points in the plane, and consider the construction lines determined by the arrangement, subject to the two rules in Section 1. Upper-bound conjecture. At most k+1k+1 construction lines are determined by the kk registration marks. The conjecture is motivated by the classification of near-pencils, augmented near-pencils, and railtracks, all of which determine at most k+1k+1 construction lines; no arrangement with more than k+1k+1 lines has been identified, but the claim remains open.

Sources & referencesView supporting material

Primary source

Alexandros Haridis, “Some Open Problems Regarding the Number of Lines and Slopes in Arrangements that Determine Shapes”, arXiv:2011.10700 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.