The loop-linking number of line arrangements
نویسندگان
چکیده
In his Ph.D. thesis, Cadegan-Schlieper constructs an invariant of the embedded topology a line arrangement which generalizes $$\mathcal {I}$$ -invariant introduced by Artal, Florens and author. This new is called loop-linking number in present paper. We refine result proving that homeomorphism type complement. give two effective methods to compute this invariant, both are based on braid monodromy. As application, we detect arithmetic Zariski pair arrangements with 11 lines whose coefficients 5th cyclotomic field. Furthermore, also prove fundamental groups their complements not isomorphic; it fewest have property. triple 12 non-isomorphic groups. appendix, 29 combinatorial types lead similar ordered pairs lines. To conclude paper, additivity theorem for union arrangements. first allows us Rybnikov’s homeomorphic, then leads generalization result. Lastly, use existence homotopy-equivalent lattice-isomorphic non-homeomorphic complements.
منابع مشابه
Line Arrangements in H
If M = H3/G is a hyperbolic manifold and γ ⊂ M is a simple closed geodesic, then γ lifts to a collection of lines in H3 acted upon by G. In this paper we show that such a collection of lines cannot contain a particular type of subset (called a bad triple) unless G has orientation-reversing elements. This fact allows us to extend certain lower bounds on hyperbolic volume to the non-orientable case.
متن کاملOn Invariant Line Arrangements
We classify all arrangements of lines that are invariant under foliations of degree 4 of the real projective plane.
متن کاملTopology of Generic Line Arrangements
Our aim is to generalize the result that two generic complex line arrangements are equivalent. In fact for a line arrangement A we associate its defining polynomial f = ∏ i(aix + biy + ci), so that A = (f = 0). We prove that the defining polynomials of two generic line arrangements are, up to a small deformation, topologically equivalent. In higher dimension the related result is that within a ...
متن کاملFundamental Groups of Line Arrangements
This is a survey of some recent developments in the study of complements of line arrangements in the complex plane. We investigate the fundamental groups and nite covers of those complements, focusing on homological and enumerative aspects. The unifying framework for this study is the strati-cation of the character variety of the fundamental group, G, by the jumping loci for cohomology with coe...
متن کاملInducing Polygons of Line Arrangements
We show that an arrangement A of n lines in general position in the plane has an inducing polygon of size O(n). Additionally, we present a simple algorithm for finding an inducing n-path for A in O(n log n) time and an algorithm that constructs an inducing n-gon for a special class of line arrangements within the same time bound. Eligible for best student paper
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Zeitschrift
سال: 2022
ISSN: ['1432-1823', '0025-5874']
DOI: https://doi.org/10.1007/s00209-021-02953-x