Related papers: Visibility-preserving convexifications using singl…

We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

For any $n$-dimensional simplex in the Euclidean space $\mathbb{R}^n$ with $n\ge 4$, it is asked that if a continuous deformation preserves the volumes of all the codimension 2 faces, then is it necessarily a \emph{rigid} motion. While the…

Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…

Functions that are piecewise defined are a common sight in mathematics while convexity is a property especially desired in optimization. Suppose now a piecewise-defined function is convex on each of its defining components - when can we…

Simple cycles on a digraph form a trace monoid under the rule that two such cycles commute if and only if they are vertex disjoint. This rule describes the spatial configuration of simple cycles on the digraph. Cartier and Foata have showed…

We prove that, in all dimensions d>=4, every simple open polygonal chain and every tree may be straightened, and every simple closed polygonal chain may be convexified. These reconfigurations can be achieved by algorithms that use…

Consider the map $S$ which sends a planar polygon $P$ to a new polygon $S(P)$ whose vertices are the intersection points of second nearest sides of $P$. This map is the inverse of the famous pentagram map. In this paper we investigate the…

We prove the trichotomy between transience to the right, transience to the left and recurrence of one-dimensional nearest-neighbour random walks in dynamic random environments under fairly general assumptions, namely: stationarity under…

Helmholtz's equations provide the motion of a system of N vortices which describes a planar incompressible fluid with zero viscosity. A relative equilibrium is a particular solution of these equations for which the distances between the…

We show that every convex polyhedron admits a simple edge unfolding after an affine transformation. In particular there exists no combinatorial obstruction to a positive resolution of Durer's unfoldability problem, which answers a question…

The change of conformal moduli of polygonal quadrilaterals under some geometric transformations is studied. We consider the motion of one vertex when the other vertices remain fixed, the rotation of sides, polarization, symmetrization, and…

We consider the problem of motion of several rigid bodies immersed in a perfect compressible fluid. Using the method of convex integration we establish the existence of infinitely many weak solutions with {\it a priori} prescribed motion of…

Helmholtz theorem states that, in ideal fluid, vortex lines move with the fluid. Another Helmholtz theorem adds that strength of a vortex tube is constant along the tube. The lines may be regarded as integral surfaces of a 1-dimensional…

From the simple Lagrangian the equations of motion for the particle with spin are derived. The spin is shown to be conserved on the particle world-line. In the absence of a spin the equation coincides with that of a geodesic. The equations…

We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family…

We prove two results on convex subsets of Euclidean spaces invariant under an orthogonal group action. First, we show that invariant spectrahedra admit an equivariant spectrahedral description, i.e., can be described by an equivariant…

The problem of describing isolated rotating bodies in equilibrium in General Relativity has so far been treated under the assumption of the circularity condition in the interior of the body. For a fluid without energy flux, this condition…

We study the problem of colouring the vertices of a polygon, such that every viewer in it can see a unique colour. The goal is to minimise the number of colours used. This is also known as the conflict-free chromatic guarding problem with…

The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its visibility graph, it is an open problem to locate the vertices…