On the number of simple arrangements of five double pseudolines (Q629847): Difference between revisions

The authors describe an incremental algorithm to enumerate the isomorphism classes of double pseudoline arrangements. The correction of their algorithm is based on the connectedness under mutations of the spaces of one-extensions of double pseudoline arrangements, proved in the paper. Counting results derived from an implementation of their algorithm are also reported.