English
Related papers

Related papers: Simplex slicing: an asymptotically-sharp lower bou…

200 papers

We strengthen the connections between electrical transformations and homotopy from the planar setting---observed and studied since Steinitz---to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the…

Computational Geometry · Computer Science 2019-03-27 Hsien-Chih Chang , Marcos Cossarini , Jeff Erickson

We use the method of higher order linearization to study an inverse boundary value problem for the minimal surface equation on a Riemannian manifold $(\mathbb{R}^n,g)$, where the metric $g$ is conformally Euclidean. In particular we show…

Analysis of PDEs · Mathematics 2022-11-03 Janne Nurminen

In 3-dimensional Euclidean space, Scherk second surfaces are singly periodic embedded minimal surfaces with four planar ends. In this paper, we obtain a natural generalization of these minimal surfaces in any higher dimensional Euclidean…

Differential Geometry · Mathematics 2007-05-23 Frank Pacard

The purpose of this article is to describe a reduction of the slicing problem to the study of the parameter I_1(K,Z_q^o(K))=\int_K ||< :, x> ||_{L_q(K)}dx. We show that an upper bound of the form I_1(K,Z_q^o(K))\leq C_1q^s\sqrt{n}L_K^2,…

Functional Analysis · Mathematics 2011-07-25 Apostolos Giannopoulos , Grigoris Paouris , Beatrice-Helen Vritsiou

The purpose of this paper is twofold. One is to enrich from a geometrical point of view the theory of octonionic slice regular functions. We first prove a boundary Schwarz lemma for slice regular self-mappings of the open unit ball of the…

Complex Variables · Mathematics 2016-04-15 Xieping Wang

The minimum feature size of a crossing-free straight line drawing is the minimum distance between a vertex and a non-incident edge. This quantity measures the resolution needed to display a figure or the tool size needed to mill the figure.…

Computational Geometry · Computer Science 2009-08-19 Greg Aloupis , Erik D. Demaine , Martin L. Demaine , Vida Dujmovic , John Iacono

Detecting boundary of an image based on noisy observations is a fundamental problem of image processing and image segmentation. For a $d$-dimensional image ($d = 2, 3, \ldots$), the boundary can often be described by a closed smooth $(d -…

Statistics Theory · Mathematics 2018-02-16 Meng Li , Subhashis Ghosal

Lawson and Osserman proved that the Dirichlet problem for the minimal surface system is not always solvable in the class of Lipschitz maps. However, it is known that minimizing sequences (for area) of Lipschitz graphs converge to objects…

Analysis of PDEs · Mathematics 2024-11-22 Connor Mooney , Ovidiu Savin

We classify branched immersed disks in space forms with non-zero parallel mean curvature vector and non-orthogonal constant contact angle along the boundary in 4-dimensional space form. For higher codimensional case, we prove a codimension…

Differential Geometry · Mathematics 2026-01-21 Rui Gao , Miaomiao Zhu

In this work we study subdivisions of $k$-rotationally symmetric planar convex bodies that minimize the maximum relative diameter functional. For some particular subdivisions called $k$-partitions, consisting of $k$ curves meeting in an…

Metric Geometry · Mathematics 2015-01-19 Antonio Cañete , Uwe Schnell , Salvador Segura Gomis

Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…

Metric Geometry · Mathematics 2022-10-25 Alexander Tolmachev , Dmitry Protasov , Vsevolod Voronov

We consider minimizing a conic quadratic objective over a polyhedron. Such problems arise in parametric value-at-risk minimization, portfolio optimization, and robust optimization with ellipsoidal objective uncertainty; and they can be…

Optimization and Control · Mathematics 2018-11-06 Alper Atamturk , Andres Gomez

We develop exact piecewise polynomial sequences on Alfeld splits in any spatial dimension and any polynomial degree. An Alfeld split of a simplex is obtained by connecting the vertices of an $n$-simplex with its barycenter. We show that, on…

Numerical Analysis · Mathematics 2018-07-17 Guosheng Fu , Johnny Guzman , Michael Neilan

Towards identifying the number of minimal surfaces sharing the same boundary from the geometry of the boundary, we propose a numerical scheme with high speed and high accuracy. Our numerical scheme is based on the method of fundamental…

Numerical Analysis · Mathematics 2022-12-14 Koya Sakakibara , Yuuki Shimizu

We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this…

Computational Geometry · Computer Science 2007-05-23 Jeff Erickson , Sariel Har-Peled

$\renewcommand{\Re}{\mathbb{R}}$ We develop a general randomized technique for solving "implic it" linear programming problems, where the collection of constraints are defined implicitly by an underlying ground set of elements. In many…

Computational Geometry · Computer Science 2021-12-24 Timothy M. Chan , Sariel Har-Peled , Mitchell Jones

Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…

Numerical Analysis · Mathematics 2020-08-27 Vincent Coppé , Daan Huybrechs

Let $K \subset \mathbb R^n$ be a convex body with barycenter at the origin. We show there is a simplex $S \subset K$ having also barycenter at the origin such that $\left(\frac{vol(S)}{vol(K)}\right)^{1/n} \geq \frac{c}{\sqrt{n}},$ where…

Metric Geometry · Mathematics 2019-07-18 Daniel Galicer , Mariano Merzbacher , Damián Pinasco

For relatively prime positive integers $u_0$ and $r$, we consider the least common multiple $L_n:=\mathrm{lcm}(u_0,u_1,\ldots, u_n)$ of the finite arithmetic progression $\{u_k:=u_0+kr\}_{k=0}^n$. We derive new lower bounds on $L_n$ which…

Number Theory · Mathematics 2014-07-03 Daniel M. Kane , Scott D. Kominers

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