This paper studies the smoothness and the curvature of conflict sets of the distance function in the plane. Conflict sets are also well known as 'bisectors'. We prove smoothness in the case of two convex sets and give a formula for the curvature. We gener
Let f : ℂ^n \to ℂ be any polynomial function. By using global polar methods, we introduce models for the fibers of f and we study the monodromy at atypical values of f , including the value infinity. We construct a geometric monodromy with controlled behavior and define global relative monodromy with respect to a general linear form. We prove localization results for the relative monodromy and derive a zeta-function formula for the monodromy around an atypical value. We compute the relative zeta function in several cases and emphasize the differences to the “classical” local situation.
It is known that a closed polygon P is a critical point of the oriented area function if and only if P is a cyclic polygon, that is, P can be inscribed in a circle. Moreover, there is a short formula for the Morse index. Going further in this direction, we extend these results to the case of open polygonal chains, or robot arms. We introduce the notion of the oriented area for an open polygonal chain, prove that critical points are exactly the cyclic configurations with antipodal endpoints and derive a formula for the Morse index of a critical configuration.