Combinatorial symmetry of line arrangements and applications

preprint2013arXivOpen access

Abstract

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.