English
Related papers

Related papers: Explicit lower bounds for opaque sets of unit squa…

200 papers

For three dimensional complete Riemannian manifolds with scalar curvature no less than one, we obtain the sharp upper bound of complete stable minimal surfaces' diameter.

Differential Geometry · Mathematics 2025-05-27 Qixuan Hu , Guoyi Xu , Shuai Zhang

In this paper we obtain an analogue of Toponogov theorem in dimension 3 for compact manifolds $M^3$ with nonnegative Ricci curvature and strictly convex boundary $\partial M$. Here we obtain a sharp upper bound for the length…

Differential Geometry · Mathematics 2019-10-09 Abraão Mendes

A theorem of W. Derrick ensures that the volume of any Riemannian cube $([0,1]^n,g)$ is bounded below by the product of the distances between opposite codimension-1 faces. In this paper, we establish a discrete analog of Derrick's…

Metric Geometry · Mathematics 2016-02-24 Kyle Kinneberg

Let U be the complement of a smooth anticanonical divisor in a del Pezzo surface of degree at most 7 over a number field k. We show that there is an effective uniform bound for the size of the Brauer group of U in terms of the degree of k.

Algebraic Geometry · Mathematics 2019-03-06 Martin Bright , Julian Lyczak

The Hayman-Wu theorem states that the preimage of a line or circle L under a conformal mapping from the unit disc to a simply-connected domain U has total Euclidean length bounded by an absolute constant. The best possible constant is known…

Complex Variables · Mathematics 2007-07-13 Edward Crane

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…

Combinatorics · Mathematics 2015-01-30 Christine Bachoc , Alberto Passuello , Alain Thiery

We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…

Metric Geometry · Mathematics 2023-03-07 Alexander Barg , Peter Boyvalenkov , Maya Stoyanova

We establish general bounds on the topology of free boundary minimal surfaces obtained via min-max methods in compact, three-dimensional ambient manifolds with mean convex boundary. We prove that the first Betti number is lower…

Differential Geometry · Mathematics 2026-01-22 Giada Franz , Mario B. Schulz

In this paper we prove that a flat free-boundary minimal $n$-disk, $n\geq3$, in the unit Euclidean ball $B^{n+1}$ is the unique compact free boundary minimal hypersurface in the unit Euclidean ball which the squared norm of the second…

Differential Geometry · Mathematics 2018-07-31 Ezequiel Barbosa , Edno Pereira , Rosivaldo Antônio Gonçalves

It is known that the surface of a cone over the unit disc with large height has smaller distortion than the standard embedding of the 2-sphere in $\mathbb R^3$. In this note we show that distortion minimisers exist among convex embedded…

Metric Geometry · Mathematics 2019-04-17 Sebastian Baader , Luca Studer , Roger Züst

In this article, we study a free boundary isometric embedding problem for abstract Riemannian two-manifolds with the topology of the disc. Under the assumption of positive Gauss curvature and geodesic curvature of the boundary being equal…

Differential Geometry · Mathematics 2022-02-07 Thomas Koerber

We present a constructive lower bound of $\Omega(1/\sqrt{\varepsilon})$ for Frank-Wolfe (FW) when both the objective and the constraint set are smooth and strongly convex, showing that the known uniform $\mathcal{O}(1/\sqrt{\varepsilon})$…

Optimization and Control · Mathematics 2026-04-14 Jannis Halbey , Daniel Deza , Max Zimmer , Christophe Roux , Bartolomeo Stellato , Sebastian Pokutta

A simple n-gon is a polygon with n edges such that each vertex belongs to exactly two edges and every other point belongs to at most one edge. Brass, Moser and Pach asked the following question: For n > 3 odd, what is the maximum perimeter…

Metric Geometry · Mathematics 2012-07-18 Zsolt Lángi

We prove that the area of a free boundary minimal surface $\Sigma^2 \subset B^n$, where $B^n$ is a geodesic ball contained in a round hemisphere $\mathbb{S}^n_+$, is at least as big as that of a geodesic disk with the same radius as $B^n$;…

Differential Geometry · Mathematics 2018-07-03 Brian Freidin , Peter McGrath

We construct a subset $A$ of the unit disc with the following properties. (i) The set $A$ is the finite union of disjoint line segments. (ii) The shadow of $A$ is arbitrarily close to the shadow of the unit disc in "most" directions. (iii)…

Metric Geometry · Mathematics 2014-02-26 Krzysztof Burdzy , Tadeusz Kulczycki

We are given a set of weighted unit disks and a set of points in Euclidean plane. The minimum weight unit disk cover (\UDC) problem asks for a subset of disks of minimum total weight that covers all given points. \UDC\ is one of the…

Computational Geometry · Computer Science 2016-01-13 Jian Li , Yifei Jin

We provide a new construction of Brownian disks in terms of forests of continuous random trees equipped with nonnegative labels corresponding to distances from a distinguished point uniformly distributed on the boundary of the disk. This…

Probability · Mathematics 2020-06-22 Jean-François Le Gall

Let $f$ be an analytic function on the unit disc which is in the Dirichlet class, so the Euclidean area of the image, counting multiplicity, is finite. The Euclidean length of a radial arc of hyperbolic length $\rho$ is then $o(\rho^1/2)$.…

Complex Variables · Mathematics 2007-11-02 T. K. Carne

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…

Computational Geometry · Computer Science 2025-03-10 Justin Dallant

We study the simplex method over polyhedra satisfying certain "discrete curvature" lower bounds, which enforce that the boundary always meets vertices at sharp angles. Motivated by linear programs with totally unimodular constraint…

Data Structures and Algorithms · Computer Science 2014-12-23 Daniel Dadush , Nicolai Hähnle