Related papers: Pinwheels and bypasses
In the convex covering problem, we are given a convex polygon with holes $P$ and the goal is to cover $P$ using a small number of convex polygons that lie inside $P$. In this paper, we solve the problem using the following strategy. We find…
We consider a class of black holes for which the area of the two-dimensional spatial cross-section has a minimum on the horizon with respect to a quasiglobal (Krusckal-like) coordinate. If the horizon is regular, one can generate a tubelike…
It is known that the suspension of a simplicial complex can be realized with only one additional point. Suitable iterations of this construction generate highly symmetric simplicial complexes with various interesting combinatorial and…
Nonsingular projective varieties which are both convex and rationally connected are considered. We ask whether such varieties must be algebraic homogeneous spaces G/P. In case X is a complete intersection, an affirmative answer is obtained…
Given a generic totally real torus unknotted in the unit sphere of the complex plane, we prove the following alternative : either there exists a filling of the torus by holomorphic discs and the torus is rationally convex, or its rational…
The paper contains a general construction which produces new examples of non simply-connected smooth projective surfaces. We analyze the resulting surfaces and their fundamental groups. Many of these fundamental groups are expected to be…
A convex polyhedron $P$ is $k$-equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of $P$ are $k$-gon for some fixed value of $k$. Since 1968, it is an open problem to construct all…
We show that a quasirandom $k$-uniform hypergraph $G$ has a tight Euler tour subject to the necessary condition that $k$ divides all vertex degrees. The case when $G$ is complete confirms a conjecture of Chung, Diaconis and Graham from 1989…
John Conway's Circle Theorem is a gem of plane geometry. The six points formed by continuing the sides of a triangle beyond every vertex by the length of its opposite side, are concyclic. The theorem has attracted several proofs. We present…
For given finite system of convex polygons in the plane which have no transversal, find such homothety transformations of polygons (having fixed centres inside given polygons) with minimal similarity ratio c>1 that the transformed system…
We introduce the notion of locally consistent system of half-spaces for a real hyperplane arrangement. We embed a sphere in the complexified complement by shifting the real unit sphere into the imaginary direction indicated by the…
We derive sufficient conditions for infinite-dimensional systems whose entanglement is not completely lost in a finite time during its decoherence by a passive interaction with local vacuum environments. The sufficient conditions allow us…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
The study of traversable wormholes is very hot topic for the past 30 years. One of the best possible way to make traversable wormhole is using the thin-shells to cut and paste two spacetime which has tunnel from one region of space-time to…
The polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for…
Several results concerning pairs of polynomially convex sets whose union is not even rationally convex are given. It is shown that there is no restriction on how two spaces can be embedded in some $\C^N$ so as to be polynomially convex but…
A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as…
This note proves that arbitrary local gates together with any entangling bipartite gate V are universal. Previously this was known only when access to both V and V^{-1} was given, or when approximate universality was demanded.
We prove that the set of directions of lines intersecting three disjoint balls in $R^3$ in a given order is a strictly convex subset of $S^2$. We then generalize this result to $n$ disjoint balls in $R^d$. As a consequence, we can improve…