The height of a permutation and applications to distance between real line arrangements

Abstract

We present a new notion of a distance between two real line arrangements. We define the height of a permutation and use this idea in our main theorem, which gives us a lower bound on the distance between the pair. We apply these techniques to the seven special cases of real arrangements with ten lines found in previous work by the authors.