English
Related papers

Related papers: New area-minimizing Lawson-Osserman cones

200 papers

A regularization procedure developed in [1] for the integral curvature invariants on manifolds with conical singularities is generalized to the case of squashed cones. In general, the squashed conical singularities do not have rotational…

High Energy Physics - Theory · Physics 2015-06-16 Dmitri V. Fursaev , Alexander Patrushev , Sergey N. Solodukhin

In 1976, Leon Simon showed that if a compact subset of the boundary of a domain is smooth and has negative mean curvature, then the non-parametric least area problem with Lipschitz continuous Dirichlet boundary data has a generalized…

Analysis of PDEs · Mathematics 2016-03-30 Kirk Lancaster , Jaron Melin

Let $P$ be a set of $n$ points in the plane. We show how to find, for a given integer $k>0$, the smallest-area axis-parallel rectangle that covers $k$ points of $P$ in $O(nk^2 \log n+ n\log^2 n)$ time. We also consider the problem of, given…

Computational Geometry · Computer Science 2019-07-12 Mark de Berg , Sergio Cabello , Otfried Cheong , David Eppstein , Christian Knauer

Results are obtained for two minimization problems: $$I_k(c)=\inf \{\lambda_k(\Omega): \Omega\ \textup{open, convex in}\ \mathbb{R}^m,\ \mathcal{T}(\Omega)= c \},$$ and $$J_k(c)=\inf\{\lambda_k(\Omega): \Omega\ \textup{quasi-open in}\…

Spectral Theory · Mathematics 2017-03-31 M. van den Berg

We revisit the question of existence and regularity of minimizers to weighted least gradient problems on a fixed bounded domain, subject to a Dirichlet boundary condition, in the case where the boundary data is continuous and the weight…

Analysis of PDEs · Mathematics 2019-01-23 Andres Zuniga

We prove that every Riemannian metric on the 2-disc such that all its geodesics are minimal, is a minimal filling of its boundary (within the class of fillings homeomorphic to the disc). This improves an earlier result of the author by…

Differential Geometry · Mathematics 2011-10-03 Sergei Ivanov

Harmonic morphisms, maps which preserve Laplace's equation, are intimately connected to the topic of minimal submanifolds. In this article we first characterise harmonic morphisms between Riemannian manifolds as the weakly horizontally…

Differential Geometry · Mathematics 2026-03-03 Oskar Riedler

Consider two elements in the tangent bundle of the Euclidean plane $(x,X),(y,Y)\in T{\mathbb R}^2$. In this work we address the problem of characterizing the paths of bounded curvature and minimal length starting at $x$, finishing at $y$…

Metric Geometry · Mathematics 2017-08-23 José Ayala , David Kirszenblat , J. Hyam Rubinstein

We give a short solution to one of the main open problems in subriemannian geometry. Namely, we prove that length minimizers do not have corner-type singularities. With this result we solve Problem II of Agrachev's list, and provide the…

Differential Geometry · Mathematics 2016-12-21 Eero Hakavuori , Enrico Le Donne

It has been found in numerical experiments that when one removes a sector from an elastic sheet and glues the edges of the sector back together, the resulting configuration is radially symmetric and nearly conical. We make a rigorous…

Analysis of PDEs · Mathematics 2013-07-25 Stefan Müller , Heiner Olbermann

Lusternik-Schnirelmann category (LS-category) of a topological space is the least integer $n$ such that there is a covering of $X$ by $n+1$ open sets, each of them being contractible in $X$. The cone length is the minimum number of…

Algebraic Topology · Mathematics 2026-05-15 Paul-Eugène Parent , Daniel Tanré

We study a Lorentzian version of the well-known Calder\'{o}n problem that is concerned with determination of lower order coefficients in a wave equation on a smooth Lorentzian manifold, given the associated Dirichlet-to-Neumann map. In the…

Analysis of PDEs · Mathematics 2024-04-05 Spyros Alexakis , Ali Feizmohammadi , Lauri Oksanen

In this paper, we discuss the algorithm engineering aspects of an O(n^2)-time algorithm [6] for computing a minimum-area convex polygon that intersects a set of n isothetic line segments.

Computational Geometry · Computer Science 2016-09-07 Xin Wu , Xijie Zeng , Bryan St. Amour , Asish Mukhopadhyay

A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a…

Metric Geometry · Mathematics 2018-10-25 Philip Gibbs

We find the minimum dilatation of pseudo-Anosov homeomorphisms that stabilize an orientable foliation on surfaces of genus three, four, or five, and provide a lower bound for genus six to eight. Our technique also simplifies Cho and Ham's…

Geometric Topology · Mathematics 2011-06-23 Erwan Lanneau , Jean-Luc Thiffeault

We establish Liouville theorems for global minimizers $u$ of the Allen-Cahn energy $$\int |\nabla u|^2 + W(u) \, dx,$$ which have subquadratic growth at infinity. In particular we extend the results of \cite{S1,S3} concerning the De…

Analysis of PDEs · Mathematics 2025-03-05 Ovidiu Savin , Chilin Zhang

We prove optimal genus bounds for minimal surfaces arising from the min-max construction of Simon-Smith. This confirms a conjecture made by Pitts-Rubinstein in 1986.

Differential Geometry · Mathematics 2016-07-08 Daniel Ketover

In the early 1980s, S. T. Yau conjectured that any compact Riemannian three-manifold admits an infinite number of closed immersed minimal surfaces. We use min-max theory for the area functional to prove this conjecture in the positive Ricci…

Differential Geometry · Mathematics 2016-12-16 Fernando C. Marques , Andr'e Neves

We introduce classes of supergraphs and superpermutations with novel universal graphon and permuton limiting objects whose construction involves the two-parameter Poisson-Dirichlet process introduced by Pitman and Yor (1997). We demonstrate…

Probability · Mathematics 2026-01-21 Benedikt Stufler

We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness. This includes lower bounds for: * high-dimensional…

Data Structures and Algorithms · Computer Science 2010-10-20 Mihai Patrascu
‹ Prev 1 8 9 10 Next ›