中文
相关论文

相关论文: The area of reduced spherical polygons

200 篇论文

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

微分几何 · 数学 2009-06-19 Max Engelstein

We prove that Alexandrov's conjecture relating the area and diameter of a convex surface holds for the surface of a general ellipsoid. This is a direct consequence of a more general result which estimates the deviation from the optimal…

微分几何 · 数学 2015-12-04 Pedro Freitas , David Krejcirik

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

度量几何 · 数学 2007-05-23 Boris D. Lubachevsky , Ronald Graham

Let $G$ be a usc decomposition of $S^n$, $H_G$ denote the set of nondegenerate elements and $\pi$ be the natural projection of $S^n$ onto $S^n/G$. Suppose that each point in the decomposition space has arbitrarily small neighborhoods with…

几何拓扑 · 数学 2013-12-05 Shijie Gu

It was shown by K. Ball and F. Nazarov, that the maximal surface area of a convex set in $\mathbb{R}^n$ with respect to the Standard Gaussian measure is of order $n^{\frac{1}{4}}$. In the present paper we establish the analogous result for…

经典分析与常微分方程 · 数学 2014-09-08 Galyna Livshyts

We consider the Laplace normal vector field of relatively normalized ruled surfaces with non-vanishing Gaussian curvature in the three-dimensional Euclidean space $\mathbb{R}^{3}$. We determine all ruled surfaces and all relative…

微分几何 · 数学 2016-03-16 Stylianos Stamatakis

Let $\Omega$ be a measurable Euclidean set in $\mathbb{R}^{n}$ that is symmetric, i.e. $\Omega=-\Omega$, such that $\Omega\times\mathbb{R}$ has the smallest Gaussian surface area among all measurable symmetric sets of fixed Gaussian volume.…

概率论 · 数学 2022-04-27 Steven Heilman

The assimilation of a quantum (finite size) particle by a Reissner-Nordstr\"om black hole inevitably involves an increase in the black-hole surface area. It is shown that this increase can be minimized if one considers the capture of the…

广义相对论与量子宇宙学 · 物理学 2010-11-19 Shahar Hod

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…

度量几何 · 数学 2021-08-31 Fei Xue , Yanlu Lian , Jun Wang , Yuqin Zhang

The convex shape contained in a disk having prescribed area and maximal perimeter is completely characterized in terms of the area fraction. The solution is always a polygon having all but one sides equal. The lengths of the sides are…

度量几何 · 数学 2024-02-09 Beniamin Bogosel

We extend some theorems for the Infinity-Ground State and for the Infinity-Potential, known for convex polygons, to other domains in the plane, by applying Alexandroff's method to the curved boundary. A recent explicit solution disproves a…

偏微分方程分析 · 数学 2023-01-24 Karl K. Brustad , Erik Lindgren , Peter Lindqvist

We study a polyhedron with $n$ vertices of fixed volume having minimum surface area. Completing the proof of Fejes Toth, we show that all faces of a minimum polyhedron are triangles, and further prove that a minimum polyhedron does not…

度量几何 · 数学 2020-12-21 Shigeki Akiyama

For sufficiently large $n$, we show that in every configuration of $n$ points chosen inside the unit square there exists a triangle of area less than $n^{-8/7-1/2000}$. This improves upon a result of Koml\'os, Pintz and Szemer\'edi from…

组合数学 · 数学 2023-05-30 Alex Cohen , Cosmin Pohoata , Dmitrii Zakharov

A non-algorithmic, generalized version of a recent result, asserting that a natural relaxation of the Koml\'os conjecture from boolean discrepancy to spherical discrepancy is true, is proved by a very short argument using convex geometry.

度量几何 · 数学 2021-12-02 Yossi Lonke

A convex polygon Q is circumscribed about a convex polygon P if every vertex of P lies on at least one side of Q. We present an algorithm for finding a maximum area convex polygon circumscribed about any given convex n-gon in O(n^3) time.…

度量几何 · 数学 2024-03-25 Markus Ausserhofer , Susanna Dann , Zsolt Lángi , Géza Tóth

Certain topics on polygons are extended from Euclidean to hyperbolic geometry. This first part deals with uniqueness and existence of cocyclic polygons with prescribed sidelengths. The non-Euclidean versions are more difficult due to the…

度量几何 · 数学 2010-08-23 Rolf Walter

Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…

组合数学 · 数学 2017-01-04 Rom Pinchasi , Yuri Rabinovich

Let $G$ be a u.s.c decomposition of $S^n$, $H_G$ denote the set of nondegenerate elements and $\pi$ be the projection of $S^n$ onto $S^n/G$. Suppose that each point in the decomposition space has arbitrarily small neighborhoods with…

几何拓扑 · 数学 2014-06-04 Shijie Gu

What is the shape of the 2D convex region P from which, when 2 mutually congruent convex pieces with maximum possible area are cut out, the highest fraction of the area of P is left over? When P is restricted to the set of all possible…

组合数学 · 数学 2011-02-24 R. Nandakumar

We prove upper and lower bounds on the minimal spherical dispersion, improving upon previous estimates obtained by Rote and Tichy [Spherical dispersion with an application to polygonal approximation of curves, Anz. \"Osterreich. Akad. Wiss.…

度量几何 · 数学 2022-01-20 Joscha Prochno , Daniel Rudolf