Abstract. Given a simple arrangement of n pseudolines in the Euclidean plane, associate with line i the list σi of the lines crossing i in the order of the crossings on line i.
$\sigma_i=(\sigma^i_1,\sigma^i_2,\ldots,\sigma^i_{n-1})$ is a permutation of
$\{1,\ldots,n\} - \{i\}$ . The vector (σ1 ,σ2, ...,σ_n) is an encoding for the arrangement. Define
$\tau^i_j = 1$ if
$\sigma^i_j > i$ and
$\tau^i_j = 0$ , otherwise. Let
$\tau_i=(\tau^i_1,\tau^i_2,\ldots,\tau^i_{n-1})$ , we show that the vector (τ1, τ2, ... , τ_n) is already an encoding. We use this encoding to improve the upper bound on the number of arrangements of n pseudolines to
$2^{0.6974\cdot n^2}$ . Moreover, we have enumerated arrangements with 10 pseudolines. As a byproduct we determine their exact number and we can show that the maximal number of halving lines of 10 point in the plane is 13.
[1]
B. Grünbaum.
Arrangements and Spreads
,
1972
.
[2]
RICHARD P. STANLEY,et al.
On the Number of Reduced Decompositions of Elements of Coxeter Groups
,
1984,
Eur. J. Comb..
[3]
Richard Pollack,et al.
Semispaces of Configurations, Cell Complexes of Arrangements
,
1984,
J. Comb. Theory, Ser. A.
[4]
Leonidas J. Guibas,et al.
Topologically sweeping an arrangement
,
1986,
STOC '86.
[5]
B. Sturmfels.
Oriented Matroids
,
1993
.
[6]
David Eppstein,et al.
Horizon Theorems for Lines and Polygons
,
1990,
Discrete and Computational Geometry.
[7]
R. Pollack,et al.
Allowable Sequences and Order Types in Discrete and Computational Geometry
,
1993
.
[8]
Emo Welzl.
More onk-sets of finite sets in the plane
,
1986,
Discret. Comput. Geom..