Related papers: A smaller cover for closed unit curves

This article explores a new type of optimal covering of a complete graph by small cliques of different sizes, namely the minimum covering with minimum excess. In particular, the minimum size of a covering by triples and quadruples with…

This paper deals with cyclic covers of a large family of rational normal surfaces that can also be described as quotients of a product, where the factors are cyclic covers of algebraic curves. We use a generalization of Esnault-Viehweg…

We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings…

We study the optimal packing of short, hard spherocylinders confined to lie tangential to a spherical surface, using simulated annealing and molecular dynamics simulations. For clusters of up to twelve particles, we map out the changes in…

It is a well-known fact that families of minimal rational curves on rational homogeneous manifolds of Picard number one are uniform, in the sense that the tangent bundle to the manifold has the same splitting type on each curve of the…

In the MINIMUM CONVEX COVER (MCC) problem, we are given a simple polygon $\mathcal P$ and an integer $k$, and the question is if there exist $k$ convex polygons whose union is $\mathcal P$. It is known that MCC is $\mathsf{NP}$-hard…

A famous conjecture of Tuza states that the minimum number of edges needed to cover all the triangles in a graph is at most twice the maximum number of edge-disjoint triangles. This conjecture was couched in a broader setting by Aharoni and…

Hartsfield and Ringel constructed orientable quadrangular embeddings of the complete graph $K_n$ for $n\equiv 5 \pmod 8$, and nonorientable ones for $n \ge 9$ and $n\equiv 1 \pmod 4$. These provide minimal quadrangulations of their…

Bicovering arcs in Galois affine planes of odd order are a powerful tool for constructing complete caps in spaces of higher dimensions. In this paper we investigate whether some arcs contained in nodal cubic curves are bicovering. For…

We construct compact arbitrary Euler characteristic orientable and non-orientable minimal surfaces in the Berger spheres. Besides we show an interesting family of surfaces that are minimal in every Berger sphere, characterizing them by this…

We introduce the $R$ cut-off covering spectrum and the cut-off covering spectrum of a complete length space or Riemannian manifold. The spectra measure the sizes of localized holes in the space and are defined using covering spaces called…

In this paper we consider surfaces with one or two families of spherical curvature lines. We show that every surface with a family of spherical curvature lines can locally be generated by a pair of initial data: a suitable curve of Lie…

Let $P$ be a set of $n$ points in the plane. We show how to find, for a given integer $k>0$, the smallest-area axis-parallel rectangle that covers $k$ points of $P$ in $O(nk^2 \log n+ n\log^2 n)$ time. We also consider the problem of, given…

We show that deciding whether a given set of circles can be packed into a rectangle, an equilateral triangle, or a unit square are NP-hard problems, settling the complexity of these natural packing problems. On the positive side, we show…

Let $F_g$ denote a closed oriented surface of genus $g$. A set of simple closed curves is called a filling of $F_g$ if its complement is a disjoint union of discs. The mapping class group $\text{Mod}(F_g)$ of genus $g$ acts on the set of…

We consider compact connected minimal surfaces, with a pair of boundary curves (not necessarily convex) in distinct planes, that have least-area amongst all orientable surfaces with the same boundary. When the planes containing these two…

K. Bezdek and Gy. Kiss showed that existence of origin-symmetric coverings of unit sphere in $\mathbb{E}^n$ by at most $2^n$ congruent spherical caps with radius not exceeding $\arccos\sqrt{\frac{n-1}{2n}}$ implies the $X$-ray conjecture…

The minimum convex cover problem seeks to cover a polygon $P$ with the fewest convex polygons that lie within $P$. This problem is $\exists\mathbb R$-complete, and the best previously known algorithm, due to Eidenbenz and Widmayer (2001),…

We study the SL(2,R)-infimal lengths of simple closed curves on half-translation surfaces. Our main result is a characterization of Veech surfaces in terms of these lengths. We also revisit the "no small virtual triangles" theorem of…

Recently Andrews and Bryan [3] discovered a comparison function which allows them to shorten the classical proof of the well-known fact that the curve shortening flow shrinks embedded closed curves in the plane to a round point. Using this…