相关论文: The Lonely Vertex Problem

In this paper, we study the problem of finding the Euclidean distance to a convex cone generated by a set of discrete points in $\mathbb{R}^n_+$. In particular, we are interested in problems where the discrete points are the set of feasible…

The article studies a generalization of the classical Fermat-Torricelli problem to normed spaces of arbitrary finite dimension. Necessary and sufficient conditions for the uniqueness of the solution of the Fermat-Torricelli problem for any…

Properties of two classes of generally convex sets in the n-dimentional real Euclidean space, called m-semiconvex and weakly m-semiconvex, 1<=m<n, are investigated in the present work. In particular, it is established that an open set with…

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…

We study the convex polytope of n x n stochastic matrices that define locally differentially private mechanisms. We first present invariance properties of the polytope and results reducing the number of constraints needed to define it. Our…

It is classically known that a real cubic surface in the real projective 3-space cannot have more than one solitary point (locally given by x^2+y^2+z^2=0) whereas it can have up to four nodes (x^2+y^2-z^2=0). We show that on any surface of…

Given a triangulation of a closed topological cube, we show that (under some technical condition) there is an essentially unique tiling of a rectangular parallelepiped by cubes, indexed by the vertices of the triangulation. Moreover, i -…

We investigate complete non-orientable minimal surfaces of finite total curvature in $\mathbb{R}^3$ such that their ends are foliated by closed lines of curvature. This condition on the ends is necessary if they have a piece inside some…

Given a trivalent graph in the 3-dimensional Euclidean space, we call it a discrete surface because it has a tangent space at each vertex determined by its neighbor vertices. To abstract a continuum object hidden in the discrete surface, we…

We extend the result of D. Phillips (On one-homogeneous solutions to elliptic systems in two dimensions. C. R. Math. Acad. Sci. Paris 335 (2002), no. 1, 39-42) by showing that one-homogeneous solutions of certain elliptic systems in…

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…

We uncover some connections between the topology of a complete Riemannian surface M and the minimum number of vertices, i.e., critical points of geodesic curvature, of closed curves in M. In particular we show that the space forms with…

We study the smallest intersecting and enclosing ball problems in Euclidean spaces for input objects that are compact and convex. They link and unify many problems in computational geometry and machine learning. We show that both problems…

We study three new versions of the All-Ones Problem and the Minimum All-Ones Problem. The original All-Ones Problem is simply called the Vertex-Vertex Problem, and the three new versions are called the Vertex-Edge Problem, the Edge-Vertex…

We give a simple proof of T. Stehling's result, that in any normal tiling of the plane with convex polygons with number of sides not less than six, all tiles except the finite number are hexagons.

It is broadly known that any parallelepiped tiles space by translating copies of itself along its edges. In earlier work relating to higher-dimensional sandpile groups, the second author discovered a novel construction which fragments the…

We consider the {\em Shaped Partition Problem} of partitioning $n$ given vectors in real $k$-space into $p$ parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary…

In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…

This article examines the tilings of a strip with equilateral triangles. The number of ways in which the lattices can be covered with a combination of tiles of the two types of triangles is related to Pell's numbers. Additionally, the…