English
Related papers

Related papers: A Sharp Bound for the Growth of Minimal Graphs

200 papers

In this paper, we shall study the Dirichlet problem for the minimal surfaces equation. We prove some results about the boundary behaviour of a solution of this problem. We describe the behaviour of a non-converging sequence of solutions in…

Differential Geometry · Mathematics 2007-05-23 Laurent Mazet

New Hardy type inequalities in sectorial area and as a limit in an exterior of a ball are proved. Sharpness of the inequalities is shown as well.

Analysis of PDEs · Mathematics 2021-03-17 Nikolai Kutev , Tsviatko Rangelov

We prove weak and strong maximum principles, including a Hopf lemma, for smooth subsolutions to equations defined by linear, second-order, partial differential operators whose principal symbols vanish along a portion of the domain boundary.…

Analysis of PDEs · Mathematics 2016-04-08 Paul M. N. Feehan

We study the Hardy inequality when the singularity is placed on the boundary of a bounded domain in $\mathbb{R}^n$ that satisfies both an interior and exterior ball condition at the singularity. We obtain the sharp Hardy constant $n^2/4$ in…

Analysis of PDEs · Mathematics 2018-04-06 Gerassimos Barbatis , Stathis Filippas , Achilles Tertikas

We prove lower bounds for the minimum distance of algebraic geometry codes over surfaces whose canonical divisor is either nef or anti-strictly nef and over surfaces without irreducible curves of small genus. We sharpen these lower bounds…

Algebraic Geometry · Mathematics 2020-03-04 Yves Aubry , Elena Berardini , Fabien Herbaut , Marc Perret

The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…

Computational Geometry · Computer Science 2023-02-21 Sujoy Bhore , Robert Ganian , Liana Khazaliya , Fabrizio Montecchiani , Martin Nöllenburg

A matching cut is a matching that is also an edge cut. In the problem Minimum Matching Cut, we ask for a matching cut with the minimum number of edges in the matching. We investigate the differences in complexity between Minimum Matching…

Combinatorics · Mathematics 2026-02-20 Felicia Lucke , Joseph Marchand , Jannik Olbrich

We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…

Metric Geometry · Mathematics 2025-02-20 Florian Grundbacher

The bandwidth of a graph is the labeling of vertices with minimum maximum edge difference. For many graph families this is NP-complete. A classic result computes the bandwidth for the hypercube. We generalize this result to give sharp lower…

Discrete Mathematics · Computer Science 2007-05-23 Tanya Y. Berger-Wolf , Mitchell A. Harris

For a class of functions (called minimal Rad\'o functions) that arise naturally in minimal surface theory, we bound the number of interior critical points (counting multiplicity) in terms of the boundary data and the Euler characteristic of…

Differential Geometry · Mathematics 2023-06-22 David Hoffman , Francisco Martín , Brian White

In this paper, we prove sharp gradient estimates for positive solutions to the weighted heat equation on smooth metric measure spaces with compact boundary. As an application, we prove Liouville theorems for ancient solutions satisfying the…

Differential Geometry · Mathematics 2021-05-14 Ha Tuan Dung , Nguyen Thac Dung , Jia-Yong Wu

This paper establishes pointwise estimates up to boundary for the gradient of weak solutions to a class of very singular quasilinear elliptic equations with mixed data: \begin{cases} -\operatorname{div}(A(x,D u))=g-\operatorname{div} f…

Analysis of PDEs · Mathematics 2020-11-24 Tan Duc Do , Le Xuan Truong , Nguyen Ngoc Trong

Bounds on the minimum degree and on the number of vertices at- taining it have been much studied for finite edge-/vertex-minimally k- connected/k-edge-connected graphs. We give an overview of the results known for finite graphs, and show…

Combinatorics · Mathematics 2015-03-18 Maya Stein

Let $(M, g)$ be an $n$-dimensional complete Riemannian manifold with $Ric(M)\geq-(n-1)Q$, where $Q\geq0$ is a constant. We obtain an interior gradient bound for minimal graphs in $M\times R$ under some technical assumptions. For details,…

Differential Geometry · Mathematics 2007-05-23 Li Ma , Dezhong Chen

We establish shape holomorphy results for general weakly- and hyper-singular boundary integral operators arising from second-order partial differential equations in unbounded two-dimensional domains with multiple finite-length open arcs.…

Analysis of PDEs · Mathematics 2023-05-26 Jose Pinto , Fernando Henríquez , Carlos Jerez-Hanckes

We prove a new kind of estimate that holds on any manifold with lower Ricci bounds. It relates the geometry of two small balls with the same radius, potentially far apart, but centered in the interior of a common minimizing geodesic. It…

Differential Geometry · Mathematics 2011-09-23 Tobias Colding , Aaron Naber

Many load balancing problems that arise in scientific computing applications ask to partition a graph with weights on the vertices and costs on the edges into a given number of almost equally-weighted parts such that the maximum boundary…

Data Structures and Algorithms · Computer Science 2007-05-23 David Steurer

The creation and justification of the methods for minimax estimation of parameters of the external boundary value problems for the Helmholtz equation in unbounded domains are considered. When observations are distributed in subdomains, the…

Analysis of PDEs · Mathematics 2009-10-14 Yury Podlipenko , Yury Shestopalov , Vladimir Prishlyak

In this paper, we study closed embedded minimal hypersurfaces in a Riemannian $(n+1)$-manifold ($2\le n\le 6$) that minimize area among such hypersurfaces. We show they exist and arise either by minimization techniques or by min-max…

Differential Geometry · Mathematics 2015-03-20 Laurent Mazet , Harold Rosenberg

We study different notions of slope of a vector bundle over a smooth projective curve with respect to ampleness and affineness in order to apply this to tight closure problems. This method gives new degree estimates from above and from…

Algebraic Geometry · Mathematics 2007-05-23 Holger Brenner