New Lower Bounds for the Number of Pseudoline Arrangements

09/10/2018
by   Adrian Dumitrescu, et al.
0

Arrangements of lines and pseudolines are fundamental objects in discrete and computational geometry. They also appear in other areas of computer science, such as the study of sorting networks. Let B_n be the number of arrangements of n pseudolines and let b_n=B_n. The problem of estimating B_n was posed by Knuth in 1992. Knuth conjectured that b_n ≤n 2 + o(n^2) and also derived the first upper and lower bounds: b_n ≤ 0.7924 (n^2 +n) and b_n ≥ n^2/6 -O(n). The upper bound underwent several improvements, b_n ≤ 0.6988 n^2 (Felsner, 1997), and b_n ≤ 0.6571 n^2 (Felsner and Valtr, 2011), for large n. Here we show that b_n ≥ cn^2 -O(n n) for some constant c>0.2083. In particular, b_n ≥ 0.2083 n^2 for large n. This improves the previous best lower bound, b_n ≥ 0.1887 n^2, due to Felsner and Valtr (2011). Our arguments are elementary and geometric in nature. Further, our constructions are likely to spur new developments and improved lower bounds for related problems, such as in topological graph drawings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/31/2017

The Constant of Proportionality in Lower Bound Constructions of Point-Line Incidences

Let I(n,l) denote the maximum possible number of incidences between n po...
research
01/09/2019

Fragile Complexity of Comparison-Based Algorithms

We initiate a study of algorithms with a focus on the computational comp...
research
03/29/2021

An upper bound on the size of Sidon sets

In this entry point into the subject, combining two elementary proofs, w...
research
07/29/2013

Tight Lower Bounds for Homology Inference

The homology groups of a manifold are important topological invariants t...
research
01/17/2020

Lower bounds for the maximum number of runners that cause loneliness, and its application to Isolation

We consider (n+1) runners with given constant unique integer speeds runn...
research
08/30/2022

Lower bound for constant-size local certification

Given a network property or a data structure, a local certification is a...
research
07/23/2022

A New Approach to Drifting Games, Based on Asymptotically Optimal Potentials

We develop a new approach to drifting games, a class of two-person games...

Please sign up or login with your details

Forgot password? Click here to reset