Related papers: Visibility-preserving convexifications using singl…
Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an n-dimensional space equipped with a convex hull operator, by the…
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices…
The manuscript presents a theoretical proof in conglomeration with new definitions on Inaccessibility and Inside for a point S related to a simple or self intersecting polygon P. The proposed analytical solution depicts a novel way of…
We prove a general embedding theorem for Cohen--Macaulay curves (possibly nonreduced), and deduce a cheap proof of the standard results on pluricanonical embeddings of surfaces, assuming vanishing H^1(2K_X)=0.
A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…
In the literature, the matchings between spacetimes have been most of the times implicitly assumed to preserve some of the symmetries of the problem involved. But no definition for this kind of matching was given until recently. Loosely…
We show that local deformations, near closed subsets, of solutions to open partial differential relations can be extended to global deformations, provided all but the highest derivatives stay constant along the subset. The applicability of…
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the…
We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an $O(n\log n)$-time algorithm for the two-center…
Many trace inequalities can be expressed either as concavity/convexity theorems or as monotonicity theorems. A classic example is the joint convexity of the quantum relative entropy which is equivalent to the Data Processing Inequality. The…
We consider Calderon's inverse problem with partial data in dimensions $n \geq 3$. If the inaccessible part of the boundary satisfies a (conformal) flatness condition in one direction, we show that this problem reduces to the invertibility…
We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued…
The main problem considered in the present paper is to single out classes of convex sets, whose convexity property is preserved under nonlinear smooth transformations. Extending an approach due to B.T. Polyak, the present study focusses on…
We devise an algorithm for maintaining the visibility polygon of any query point in a dynamic polygonal domain, i.e., as the polygonal domain is modified with vertex insertions and deletions to its obstacles, we update the data structures…
We prove in this note that local geometric uniqueness holds true without loss of regularity for Einstein equations coupled with a large class of matter models. We thus extend the Planchon-Rodnianski uniqueness theorem for vacuum spacetimes.…
An open set in C^n is pseudoconvex if and only if its intersection with every affine subspace of complex dimension two as seen as an open set in C^2 is pseudoconvex.
This paper is about the metaphysical debate whether objects persist over time by the selfsame object existing at different times (nowadays called `endurance' by metaphysicians), or by different temporal parts, or stages, existing at…
The restricted three-vortex problem is investigated with one of the point vortices fixed in the plane. The motion of the free vortex having zero circulation is explored from a rotating frame of reference within which the free vortex with…
The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets is developed. In particular, it is shown that this concept is useful in the study of best…
We show that for a non-degenerate dimer model, both the first consistency condition of Mozgovoy and Reineke and the properly-orderedness condition of Gulotta are equivalent to a condition on zigzag paths, which goes back to Hanany and Vegh.…