Improved Bound on the Number of Pseudoline Arrangements via the Zone Theorem

TL;DR

This paper improves the upper bound on the number of simple pseudoline arrangements to 2^{0.6496n^2} by combining existing methods with the Zone Theorem, refining previous bounds significantly.

Contribution

It introduces a new, simpler argument that combines prior approaches with the Zone Theorem to tighten the upper bound on pseudoline arrangements.

Findings

Upper bound on arrangements improved to 2^{0.6496n^2}

Builds on and refines previous bounds from 1992 to 2011

Demonstrates the effectiveness of combining existing methods with the Zone Theorem

Abstract

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past decades. The lower bound in particular has seen two successive improvements in recent years (Dumitrescu and Mandal in 2020 and Cort\'es K\"uhnast et al. in 2024). Here we focus on the upper bound, and show that for large enough $n$, there are at most $2^{0.6496n^2}$ different simple arrangements of $n$ pseudolines. This follows a series of incremental improvements starting with work by Knuth in 1992 showing a bound of roughly $2^{0.7925n^2},$ then a bound of $2^{0.6975n^2}$ by Felsner in 1997, and finally the previous best known bound of $2^{0.6572n^2}$ by Felsner and Valtr in 2011. The improved bound presented here follows from a simple argument to combine the approach of this latter work with the use of the Zone Theorem.