Related papers: A note on the pyjama problem
Classic mass partition results are about dividing the plane into regions that are equal with respect to one or more measures (masses). We introduce a new concept in which the notion of partition is replaced by that of a cover. In this case…
It is known that every homeomorphism of the plane has a fixed point in a non-separating, invariant subcontinuum. Easy examples show that a branched covering map of the plane can be periodic point free. In this paper we show that any…
We prove compactness of solutions of a fully nonlinear Yamabe problem satisfying a lower Ricci curvature bound, when the manifold is not conformally diffeomorphic to the standard sphere. This allows us to prove the existence of solutions…
We consider the smallest-area universal covering of planar objects of perimeter 2 (or equivalently closed curves of length 2) allowing translation and discrete rotations. In particular, we show that the solution is an equilateral triangle…
We prove that every complete non-compact manifold of finite volume contains a (possibly non-compact) minimal hypersurface of finite volume. The main tool is the following result of independent interest: if a region $U$ can be swept out by a…
Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…
Consider a periodical (in two independent directions) tiling of the plane with polygons (faces). In this article we shall only give examples using squares, regular hexagons, equilateral triangles and parallelograms ("unions" of two…
We obtain uncountably many periodic solutions to the singular Yamabe problem on a round sphere, that blow up along a great circle. These are (complete) constant scalar curvature metrics on the complement of $S^1$ inside $S^m$, $m\geq 5$,…
We consider $k$ intervals on the real line whose images under a continuous map $f$ contain themselves. It's conjectured that there exists a periodic point of period not bigger than $k$ in these intervals. We prove the conjecture for $k=5$…
The covering radius problem is a question in coding theory concerned with finding the minimum radius $r$ such that, given a code that is a subset of an underlying metric space, balls of radius $r$ over its code words cover the entire metric…
In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…
There exist tilings of the plane with pairwise noncongruent triangles of equal area and bounded perimeter. Analogously, there exist tilings with triangles of equal perimeter, the areas of which are bounded from below by a positive constant.…
We provide the currently fastest randomized (1+epsilon)-approximation algorithm for the closest vector problem in the infinity norm. The running time of our method depends on the dimension n and the approximation guarantee epsilon by 2^O(n)…
Classically, Plateau's problem asks to find a surface of the least area with a given boundary $B$. In this article, we investigate a version of Plateau's problem, where the boundary of an admissible surface is only required to partially…
We consider a point mass on a horizontal plane. The motion of the plane is given. The plane moves periodically such that all its points have congruent closed trajectories. There is the Coulomb friction between the point mass and the plane.…
We give a review of results on the minimum convex cover and maximum hidden set problems. In addition, we give some new results. First we show that it is NP-hard to determine whether a polygon has the same convex cover number as its hidden…
The existence of global weak solutions is proved for one-dimensional lubrication models that describe the dewetting process of nanoscopic thin polymer films on hydrophobyzed substrates and take account of large slippage at the…
Criterions for constancy of the holomorphic sectional curvature and the antiholomorphic sectional curvature are proved for almost Hermitian manifolds. It is shown, that an almost Hermitian manifold satisfying the axiom of antiholomorphic…
The airplane refueling problem is a nonlinear combinatorial optimization problem, and its equivalent problem the $n$-vehicle exploration problem is proved to be NP-complete (arXiv:2304.03965v1, The $n$-vehicle exploration problem is…
Nandakumar asked whether there is a tiling of the plane by pairwise non-congruent triangles of equal area and equal perimeter. Here a weaker result is obtained: there is a tiling of the plane by pairwise non-congruent triangles of equal…