English
Related papers

Related papers: Areas of spherical polyhedral surfaces with regula…

200 papers

The present paper aims to solve some problems proposed by Lassak about the reduced spherical polygons. The main result is to show that the regular spherical n-gon has the minimal perimeter among all reduced spherical polygons of fixed…

Metric Geometry · Mathematics 2022-04-14 Cen Liu , Yanxun Chang

In this paper we study the geometry of metric spheres in the curve complex of a surface, with the goal of determining the "average" distance between points on a given sphere. Averaging is not technically possible because metric spheres in…

Geometric Topology · Mathematics 2012-05-01 Spencer Dowdall , Moon Duchin , Howard Masur

Consider a 2-plane $P \subset \mathbb{C}^n$ and let $D$ be a bounded region in $P$ with a piecewise-smooth boundary. Let $I(D)$ be the infimum of areas of all piecewise-smooth isotropic surfaces in $\mathbb{C}^n$ with the same boundary as…

Differential Geometry · Mathematics 2007-05-23 Edward Goldstein

A stationary rotating surface is a compact surface in Euclidean space whose mean curvature $H$ at each point $x$ satisfies $2H(x)=a r^2+b$, where $r$ is the distance from $x$ to a fixed straight-line $L$, and $a$ and $b$ are constants.…

Differential Geometry · Mathematics 2008-09-24 Rafael López

This paper focuses on curves and surfaces of constant width, with some additional results about general ovals. We emphasize the use of Fourier series to derive properties, some of which are known. Amongst other results, we show that the…

Differential Geometry · Mathematics 2015-04-28 Howard L. Resnikoff

We apply Diophantine analysis to classify edge-to-edge tilings of the sphere by congruent almost equilateral quadrilaterals (i.e., edge combination a3b). Parallel to a complete classification by Cheung, Luk and Yan, the method implemented…

Combinatorics · Mathematics 2022-08-05 Ho Man Cheung , Hoi Ping Luk

Answering a question of Benjamini & Schramm [8], we show that the Poisson boundary of any planar, uniquely absorbing (e.g. one-ended and transient) graph with bounded degrees can be realised geometrically as a circle, namely as the boundary…

Probability · Mathematics 2014-01-24 Agelos Georgakopoulos

Spherical Designs are finite sets of points on the sphere $\mathbb{S}^{d}$ with the property that the average of certain (low-degree) polynomials in these points coincides with the global average of the polynomial on $\mathbb{S}^{d}$. They…

Combinatorics · Mathematics 2019-08-02 Stefan Steinerberger

An embedded cubic graph consisting of segments of geodesics such that the angles at any vertex are equal to $2\pi/3$ is a closed local minimal net. This net is regular if all segments of geodesics are equal. The problem of classification of…

Differential Geometry · Mathematics 2007-05-23 A. Vdovina , E. Selivanova

We discuss a general formula for the area of the surface that is generated by a graph $[t_0, t_1] \to \mathbb R^2$ sending $t \mapsto \bigl(x(t), y(t) \bigr)$ revolved around a general line $L: A x + B y = C$. As a corollary, we obtain a…

History and Overview · Mathematics 2011-08-15 Edray Herber Goins , Talitha M. Washington

We consider a quadratic form defined on the surfaces with parallel mean curvature vector of an any dimensional complex space form and prove that its $(2,0)$-part is holomorphic. When the complex dimension of the ambient space is equal to…

Differential Geometry · Mathematics 2010-11-30 Dorel Fetcu

Discrete normal surfaces are normal surfaces whose intersection with each tetrahedron of a triangulation has at most one component. They are also natural Poincar\'e duals to 1-cocycles with $\ZZ/2\ZZ$-coefficients. For a fixed cohomology…

Geometric Topology · Mathematics 2013-11-07 Ed Swartz

We consider a complete biharmonic hypersurface with nowhere zero mean curvature vector field $\phi:(M^m,g)\rightarrow (S^{m+1},h)$ in a sphere. If the squared norm of the second fundamental form $B$ is bounded from above by m, and $\int_M…

Differential Geometry · Mathematics 2015-06-16 Shun Maeta

We study the geometry of surfaces in $\mathbb{R}^{4}$ with corank $1$ singularities. For such surfaces the singularities are isolated and at each point we define the curvature parabola in the normal space. This curve codifies all the second…

Differential Geometry · Mathematics 2019-09-17 Pedro Benedini Riul , Raúl Oset Sinha , Maria Aparecida Soares Ruas

A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…

Combinatorics · Mathematics 2017-11-06 Basudeb Datta , Subhojoy Gupta

When a pair of non-incident edges of a tetrahedron is chosen, the midpoints of the remaining 4 edges are the vertices of a planar parallelogram. A formula is given in terms of the six edge lengths for the area of this parallelogram. It is…

Metric Geometry · Mathematics 2019-09-11 David N. Yetter

We compute the rational cohomology of the universal family of smooth cubic surfaces using Vassiliev's method of simplicial resolution. Modulo embedding, the universal family has cohomology isomorphic to that of $\mathbb{P}^2$. A consequence…

Algebraic Geometry · Mathematics 2019-02-19 Ronno Das

All edge-to-edge tilings of the sphere by congruent regular triangles and congruent rhombi are classified as: (1) a $1$-parameter family of protosets each admitting a unique $(2a^3,3a^4)$-tiling like a triangular prism; (2) a $1$-parameter…

Combinatorics · Mathematics 2023-11-27 Qi Yuan , Erxiao Wang

We combine geometric methods with numerical box search algorithm to show that the minimal area of a convex set on the plane which can cover every closed plane curve of unit length is at least 0.0975. This improves the best previous lower…

Metric Geometry · Mathematics 2019-05-02 Bogdan Grechuk , Sittichoke Som-Am

We show that the 1-planar slope number of 3-connected cubic 1-planar graphs is at most 4 when edges are drawn as polygonal curves with at most 1 bend each. This bound is obtained by drawings whose vertex and crossing resolution is at least…

Computational Geometry · Computer Science 2018-08-28 Philipp Kindermann , Fabrizio Montecchiani , Lena Schlipf , André Schulz