Abstract
We study Milnor fibers of complexified real line arrangements. We give a new algorithm computing monodromy eigenspaces of the first cohomology. The algorithm is based on the description of minimal CW-complexes homotopic to the complements, and uses the real figure, that is, the adjacency relations of chambers. It enables us to generalize a vanishing result of Libgober, give new upper-bounds and characterize the -arrangement in terms of non-triviality of Milnor monodromy.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.