Justin Dallant

collaborators

2 papers

cs.CG2024

Improved Lower Bound on the Number of Pseudoline Arrangements

Justin Dallant

We show that for large enough $n$ , the number of non-isomorphic pseudoline arrangements of order $n$ is greater than $2^{c \cdot n^{2}}$ for some constant $c > 0.2604$ , improving the…

cs.DS2023

Finding the saddlepoint faster than sorting

Justin Dallant, Frederik Haagensen, Riko Jacob +2

A saddlepoint of an $n \times n$ matrix $A$ is an entry of $A$ that is a maximum in its row and a minimum in its column. Knuth (1968) gave several different algorithms for finding…