Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
We consider the problem of computing a triangulation of the real projective plane P2 , given a finite point set P = {p1, p2, . . . , pn} as input. We prove that a triangulation of...
Abstract. We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from th...
Abstract-- This paper addresses the problem of optical signalto-noise ratio (OSNR) optimization in optical networks. An analytical OSNR network model is developed for a general mul...
We prove that if two smooth manifolds intersect transversally, then the method of alternating projections converges locally at a linear rate. We bound the speed of convergence in ...