Related papers: Visibility-preserving convexifications using singl…
A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…
In this work we study the general system of geodesic equations for the case of a massive particle moving on an arbitrary curved manifold. The investigation is carried out from the symmetry perspective. By exploiting the parametrization…
A set of vertices X of a graph G is convex if it contains all vertices on shortest paths between vertices of X. We prove that for fixed p, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial…
We investigate the dynamics of the geometric transitions associated to compactified spacetimes. By including the dynamics of gravity we are able to follow the evolution of collapsing cycles as they attempt to undergo a topology changing…
The aim of this article is to establish new two-functions minimax inequalities extending classical results such as Simons' minimax theorem. Our results will be proved in a non-compact setting. We also prove, under general conditions, that…
We propose two new alternating direction methods to solve "fully" nonsmooth constrained convex problems. Our algorithms have the best known worst-case iteration-complexity guarantee under mild assumptions for both the objective residual and…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
For a class of competitive maps there is an invariant one-codimensional manifold (the carrying simplex) attracting all non-trivial orbits. In the present paper it is shown that its convexity implies that it is a $C^1$…
Let $n\geq C$ for a large universal constant $C>0$, and let $B$ be a convex body in $R^n$ such that for any $(x_1,x_2,\dots,x_n)\in B$, any choice of signs $\varepsilon_1,\varepsilon_2,\dots,\varepsilon_n\in\{-1,1\}$ and for any permutation…
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…
Equifacetal simplices, all of whose codimension one faces are congruent to one another, are studied. It is shown that the isometry group of such a simplex acts transitively on its set of vertices, and, as an application, equifacetal…
The general position problem for graphs asks for the largest number of vertices in a subset $S \subseteq V(G)$ of a graph $G$ such that for any $u,v \in S$ and any shortest $u,v$-path $P$ we have $S \cap V(P) = \{ u,v\} $, whereas the…
Let C be a simple, closed, directed curve on the surface of a convex polyhedron P. We identify several classes of curves C that "live on a cone," in the sense that C and a neighborhood to one side may be isometrically embedded on the…
The conventional decomposition of a vector field into longitudinal (potential) and transverse (vortex) components (Helmholtz's theorem) is claimed in [1] to be inapplicable to the time-dependent vector fields and, in particular, to the…
We study the Dispersive Art Gallery Problem with vertex guards: Given a polygon $\mathcal{P}$, with pairwise geodesic Euclidean vertex distance of at least $1$, and a rational number $\ell$; decide whether there is a set of vertex guards…
Suppose that $(X,Y,Z)$ is a random walk in $\mathbb{Z}^3$ that moves in the following way: on the first visit to a vertex only $Z$ changes by $\pm 1$ equally likely, while on later visits to the same vertex $(X,Y)$ performs a…
A convex surface contracting by a strictly monotone, homogeneous degree one function of curvature remains smooth until it contracts to a point in finite time, and is asymptotically spherical in shape. No assumptions are made on the…
A weak version of Birkhoff's generalization of the Perron-Frobenius theorem states that every endomorphism of a finite-dimensional real vector that leaves invariant a non-degenerate closed convex cone has an eigenvector in that cone. Here,…
Motivated by the search for reduced polytopes, we consider the following question: For which polytopes exists a vertex-facet assignment, that is, a matching between vertices and non-incident facets, so that the matching covers either all…
We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…