2000 character limit reached
On the number of simple arrangements of five double pseudolines (1009.1575v1)
Published 8 Sep 2010 in cs.CG and math.CO
Abstract: We describe an incremental algorithm to enumerate the isomorphism classes of double pseudoline arrangements. The correction of our algorithm is based on the connectedness under mutations of the spaces of one-extensions of double pseudoline arrangements, proved in this paper. Counting results derived from an implementation of our algorithm are also reported.