Combinatorial symmetry of line arrangements and applications

We introduce an algorithm that exploits a combinatorial symmetry of an arrangement in order to produce a geometric reflection between two disconnected components of its moduli space. We apply this method to disqualify three real examples found in previous work by the authors from being Zariski pairs. Robustness is shown by its application to complex cases, as well.