Related papers: The area of reduced spherical polygons

We obtain truncated restriction estimates of an unexpected form for discrete surfaces \begin{align} S = \{\, ( n_1 , \dots , n_d , R( n_1 , \dots, n_d ) ) \,,\, n_i \in [-N,N] \cap \mathbb{Z} \,\}, \end{align} where $R$ is an indefinite…

We calculate the area of the smallest triangle and the area of the smallest virtual triangle for many known lattice surfaces. We show that our list of the lattice surfaces for which the area of the smallest virtual triangle greater than .05…

The paper focuses on possible hyperbolic versions of the classical Pal isominwidth inequality in R^2 from 1921, which states that for a fixed minimal width, the regular triangle has minimal area. We note that the isominwidth problem is…

A spherical set is called convex if for every pair of its points there is at least one minimal geodesic segment that joins these points and lies in the set. We prove that for n >= 3 a complete locally-convex (topological) immersion of a…

Let $p$ be a positive number. Consider probability measure $\gamma_p$ with density $\varphi_p(y)=c_{n,p}e^{-\frac{|y|^p}{p}}$. We show that the maximal surface area of a convex body in $\mathbb{R}^n$ with respect to $\gamma_p$ is…

The hexagon is the least-perimeter tile in the Euclidean plane for any given area. On hyperbolic surfaces, this "isoperimetric" problem differs for every given area, as solutions do not scale. Cox conjectured that a regular $k$-gonal tile…

What is the smallest number of pieces that you can cut an n-sided regular polygon into so that the pieces can be rearranged to form a rectangle? Call it r(n). The rectangle may have any proportions you wish, as long as it is a rectangle.…

We prove asymptotic lower bounds on the variance of the number of vertices and missed area of random disc-polygons in convex discs whose boundary is $C_+^2$ smooth. The established lower bounds are of the same order as the upper bounds…

In this paper, we study the symplectic volume of the moduli space of polygons by using Witten's formula. We propose to use this volume as a measure for the flexibility of a polygon with fixed side-lengths. The main result of our is that…

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…

Abstract. In this paper we prove several rigidity theorems related to and including Lytchak's problem. The focus is on Alexandrov spaces with \curv\geq1, nonempty boundary, and maximal radius \frac{\pi}{2}. We exhibit many such spaces that…

We consider a variation of the classical Erd\H{o}s-Szekeres problems on the existence and number of convex $k$-gons and $k$-holes (empty $k$-gons) in a set of $n$ points in the plane. Allowing the $k$-gons to be non-convex, we show bounds…

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…

Let $M$ be a compact Riemannian manifold not containing any totally geodesic surface. Our main result shows that then the area of any complete surface immersed into $M$ is bounded by a multiple of its extrinsic curvature energy, i.e. by a…

We consider the question of which quadratic fields have elliptic curves with everywhere good reduction. By revisiting work of Setzer, we expand on congruence conditions that determine the real and imaginary quadratic fields with elliptic…

We present examples of metric spaces that are not Riemannian manifolds nor dimensionally homogeneous that satisfy the Tetrahedral Property. In spite of that, Euclidean cones over metric spaces with small diameter do not satisfy this…

We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…

We extend to higher dimensions earlier sharp bounds for the area of two dimensional free boundary minimal surfaces contained in a geodesic ball of the round sphere. This follows work of Brendle and Fraser-Schoen in the euclidean case.

Let us say that an $n$-sided polygon is semi-regular if it is circumscriptible and its angles are all equal but possibly one, which is then larger than the rest. Regular polygons, in particular, are semi-regular. We prove that semi-regular…

A \textit{Reinhardt polygon} is a convex $n$-gon that, for $n$ not a power of $2$, is optimal in three different geometric optimization problems, for example, it has maximal perimeter relative to its diameter. Some such polygons exhibit a…