English
Related papers

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

200 papers

Is it possible to obtain unbounded minimal surfaces in certain asymptotically flat 3-manifolds as a limit of solutions to a natural mountain pass problem with diverging boundaries? In this work, we give evidence that this might be true by…

Differential Geometry · Mathematics 2019-03-28 Rafael Montezuma

We give a general criterion for the Dirichlet problem at infinity (DPI) on a Cartan-Hadamard surface to be solvable, which we primarily use to give the best possible upper radial radial curvature bound for solvability of the DPI, but which…

Probability · Mathematics 2019-10-11 Robert W. Neel

In this note, we consider semiclassical scattering on a manifold which is Euclidean near infinity or asymptotically hyperbolic. We show that, if the cut-off resolvent satisfies polynomial estimates in a strip of size $O(h |\log…

Spectral Theory · Mathematics 2017-05-23 Maxime Ingremeau

We derive sharp lower bounds for L^p-functions on the n-dimensional unit hypercube in terms of their p-th marginal moments. Such bounds are the unique solutions of a system of constrained nonlinear integral equations depending on the…

Probability · Mathematics 2021-01-12 Paolo Guasoni , Eberhard Mayerhofer , Mingchuan Zhao

In this note we propose a min-max theory for embedded hypersurfaces with a fixed boundary and apply it to prove several theorems about the existence of embedded minimal hypersurfaces with a given boundary. A simpler variant of these…

Analysis of PDEs · Mathematics 2017-05-19 Camillo De Lellis , Jusuf Ramic

We develop a unified nonparametric framework for sharp partial identification and inference on inequality indices when the data contain coarsened observations of the variable of interest. We characterize the extremal allocations for all…

Econometrics · Economics 2026-03-18 James Banks , Thomas Glinnan , Tatiana Komarova

The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones…

Data Structures and Algorithms · Computer Science 2009-09-30 Clemence Magnien , Matthieu Latapy , Michel Habib

In this paper, we obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral…

Combinatorics · Mathematics 2016-07-21 Lihua You , Yujie Shu , Xiao-Dong Zhang

We develop a geometric framework for Hardy's inequality on a bounded domain when the functions do vanish only on a closed portion of the boundary.

Analysis of PDEs · Mathematics 2015-02-17 Moritz Egert , Robert Haller-Dintelmann , Joachim Rehberg

We consider operators arising from regular Dirichlet forms with vanishing killing term. We give bounds for the bottom of the (essential) spectrum in terms of exponential volume growth with respect to an intrinsic metric. As special cases we…

Functional Analysis · Mathematics 2014-02-26 Sebastian Haeseler , Matthias Keller , Radosław K. Wojciechowski

While there have been many results on lower bounds for Max Cut in unweighted graphs, there are only few results for lower bounds for Max Cut in weighted graphs. In this paper, we launch an extensive study of lower bounds for Max Cut in…

Combinatorics · Mathematics 2024-08-13 Gregory Gutin , Anders Yeo

We consider the spectral structure of indefinite second order boundary-value problems on graphs. A variational formulation for such boundary-value problems on graphs is given and we obtain both full and half-range completeness results. This…

Spectral Theory · Mathematics 2017-07-05 Sonja Currie , Bruce Alastair Watson

This paper considers some fundamental questions concerning marginally trapped surfaces, or apparent horizons, in Cauchy data sets for the Einstein equation. An area estimate for outermost marginally trapped surfaces is proved. The proof…

General Relativity and Quantum Cosmology · Physics 2009-08-05 Lars Andersson , Jan Metzger

We study of the shape of a compact singular minimal surface in terms of the geometry of its boundary, asking what type of {\it a priori} information can be obtained on the surface from the knowledge of its boundary. We derive estimates of…

Differential Geometry · Mathematics 2019-12-18 Rafael López

We study the complexity of fundamental distributed graph problems in the recently popular setting where information about the input graph is available to the nodes before the start of the computation. We focus on the most common such…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-03 Alkida Balliu , Thomas Boudier , Sebastian Brandt , Dennis Olivetti

Given an unbounded domain $\Omega$ of a Hadamard manifold $M$, it makes sense to consider the problem of finding minimal graphs with prescribed continuous data on its cone-topology-boundary, i.e., on its ordinary boundary together with its…

Differential Geometry · Mathematics 2016-02-17 Miriam Telichevesky

In this paper, we derive sharp bounds on the semigroup of the linearized incompressible Navier-Stokes equations near a stationary shear layer in the half plane and in the half space ($\mathbb{R}_+^2$ or $\mathbb{R}_+^3$), with Dirichlet…

Analysis of PDEs · Mathematics 2019-12-25 Emmanuel Grenier , Toan T. Nguyen

In this paper, we give upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and characterize the equality cases. These bounds theoretically improve and generalize some known results of Duan et al.[X. Duan, B.…

Combinatorics · Mathematics 2013-10-22 Shu-Yu Cui , Gui-Xian Tian

We obtain some fine gradient estimates near the boundary for solutions to fractional elliptic problems subject to exterior Dirichlet boundary conditions. Our results provide, in particular, the sign of the normal derivative of such…

Analysis of PDEs · Mathematics 2019-09-17 Mouhamed Moustapha Fall , Sven Jarohs

New lower bounds on the minimum distance of quasi-twisted codes over finite fields are proposed. They are based on spectral analysis and eigenvalues of polynomial matrices. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a…

Information Theory · Computer Science 2020-04-28 Martianus Frederic Ezerman , San Ling , Buket Özkaya , Jareena Tharnnukhroh