Related papers: A smaller cover for closed unit curves

For a given shape $S$ in the plane, one can ask what is the lowest possible density of a point set $P$ that pierces ("intersects", "hits") all translates of $S$. This is equivalent to determining the covering density of $S$ and as such is…

Motivated by a conjecture of Xiao, we study families of coverings of elliptic curves and their corresponding Prym map $\Phi$. More precisely, we describe the codifferential of the period map $P$ associated to $\Phi$ in terms of the residue…

By refining the volume estimate of Heintze and Karcher \cite{HK}, we obtain a sharp pinching estimate for the genus of a surface in $\mathbb S^{3}$, which involves an integral of the norm of its traceless second fundamental form. More…

A small cover is a closed smooth manifold of dimension $n$ having a locally standard $\mathbb{Z}_2^n$-action whose orbit space is isomorphic to a simple polytope. A typical example of small covers is a real projective toric manifold (or,…

We show that narrow filaments or sheets of over- or under-dense plasma, or "noodles," with fluctuations of scattering phase of less than a radian, can form the scintillation arcs seen for many pulsars. The required local fluctuations of…

A cyclic cover of the complex projective line branched at four appropriate points has a natural structure of a square-tiled surface. We describe the combinatorics of such a square-tiled surface, the geometry of the corresponding…

We produce a family of bodies in $\mathbb R^3$ parameterized by $\varepsilon > 0$, each bounded by a smooth topological sphere with principal curvatures in $[-1, 1]$, and having volume arbitrarily close to $ 16 - 4\sqrt 3 + \left(10 \sqrt 3…

We prove that the least-perimeter partition of the sphere into four regions of equal area is a tetrahedral partition.

A degree $d$ genus $g$ cover of the complex projective line by a smooth irreducible curve $C$ yields a vector bundle on the projective line by pushforward of the structure sheaf. We classify the bundles that arise this way when $d = 5$.…

This paper gives a partial confirmation of a conjecture of P. Agarwal, S. Har-Peled, M. Sharir, and K. Varadarajan that the total curvature of a shortest path on the boundary of a convex polyhedron in the 3-dimensional Euclidean space…

In this article we apply the classical method of focal loci of families to give a lower bound for the genus of curves lying on general surfaces. First we translate and reprove Xu's result that any curve C on a general surface in P^3 of…

In this article, we construct two one-parameter families of properly embedded minimal surfaces in a three-dimensional Lie group $\widetilde{E(2)}$, which is the universal covering of the group of rigid motions of Euclidean plane endowed…

The notion of covering type was recently introduced by Karoubi and Weibel to measure the complexity of a topological space by means of good coverings. When X has the homotopy type of a finite CW-complex, its covering type coincides with the…

Let S be a complete surface of constant curvature K = + 1 or -1, i.e. the sphere S^2 or the Lobachevskij plane L^2, and D a bounded convex subset of S. If S = S^2, assume also diameter (D) < pi/2. It is proved that the length of any…

Consider an arrangement of $k$ lines intersecting the unit square. There is some minimum scaling factor so that any placement of a rectangle with aspect ratio $1 \times p$ with $p\geq 1$ must non-transversely intersect some portion of the…

The problem of finding small sets that block every line passing through a unit square was first considered by Mazurkiewicz in 1916. We call such a set {\em opaque} or a {\em barrier} for the square. The shortest known barrier has length…

In response to Sanki-Vadnere, we present a short proof of the following theorem: a pair of simple curves on a hyperbolic surface whose complementary regions are disks has length at least half the perimeter of the regular right-angled…

A covering path for a finite set $P$ of points in the plane is a polygonal path such that every point of $P$ lies on a segment of the path. The vertices of the path need not be at points of $P$. A covering path is plane if its segments do…

Given a drawing of a graph, its \emph{visual complexity} is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line drawing or the number of arcs in a circular-arc drawing (in…

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…