Related papers: A Sharp Bound for the Growth of Minimal Graphs
We study viscosity solutions to the classical one-phase problem and its thin counterpart. In low dimensions, we show that when the free boundary is the graph of a continuous function, the solution is the half-plane solution. This answers,…
We give a bound on the spectral radius of subgraphs of regular graphs with given order and diameter. We give a lower bound on the smallest eigenvalue of a nonbipartite regular graph of given order and diameter.
In this paper we study the non-existence of solutions to the Dirichlet problem for minimal graphs of codimension $\geq 2$, including certain situations over domain $\Omega$ even with non-$C^1$ boundary $\partial \Omega$.
We study the asymptotic Dirichlet problem for the minimal graph equation on a Cartan-Hadamard manifold $M$ whose radial sectional curvatures outside a compact set satisfy an upper bound $$K(P)\le - \frac{\phi(\phi-1)}{r(x)^2}$$ and a…
We study the existence and uniqueness problem of compact minimal vertical graphs in $\mathbb{H}^n\times\mathbb{R}$, $n\geq 2$, over bounded domains in the slice $\mathbb{H}^n\times\{0\}$, with non-connected boundary having a finite number…
mim-width is a recent graph width measure that has seen applications in graph algorithms and problems related to propositional satisfiability. In this paper, we show linear lower bounds for the mim-width of strongly chordal split graphs,…
We study the Dirichlet problem for minimal surface systems in arbitrary dimension and codimension via mean curvature flow, and obtain the existence of minimal graphs over arbitrary mean convex bounded $C^2$ domains for a large class of…
We consider the problem of determining the manifold $n$-widths of Sobolev and Besov spaces with error measured in the $L_p$-norm. The manifold widths control how efficiently these spaces can be approximated by general non-linear parametric…
This paper proposes lower bounds on a quantity called $L^p$-norm joint spectral radius, or in short, $p$-radius, of a finite set of matrices. Despite its wide range of applications to, for example, stability analysis of switched linear…
We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain…
We study min-max theory for area functional among hypersurfaces constrained in a smooth manifold with boundary. A Schoen-Simon-type regularity result is proved for integral varifolds which satisfy a variational inequality and restrict to a…
We study asymptotic behaviors of solutions $f$ to the Dirichlet problem for minimal graphs in the hyperbolic space with singular asymptotic boundaries under the assumption that the boundaries are piecewise regular with positive curvatures.…
We survey some $L^{p}$-vanishing results for solutions of Bochner or Simons type equations with refined Kato inequalities, under spectral assumptions on the relevant Schr\"{o}dinger operators. New aspects are included in the picture. In…
The problem of monotone smoothing splines with bounds is formulated as a constrained minimization problem of the calculus of variations. Existence and uniqueness of solutions of this problem is proved, as well as the equivalence of it to a…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
We prove sharp homogeneous improvements to $L^1$ weighted Hardy inequalities involving distance from the boundary. In the case of a smooth domain, we obtain lower and upper estimates for the best constant of the remainder term. These…
Given a linear ordering of the vertices of a graph, the cutwidth of a vertex $v$ with respect to this ordering is the number of edges from any vertex before $v$ (including $v$) to any vertex after $v$ in this ordering. The cutwidth of an…
While many bounds have been proved for partial trace inequalities over the last decades for a large variety of quantities, recent problems in quantum information theory demand sharper bounds. In this work, we study optimal bounds for…
The spectral radius of a graph is the spectral radius of its adjacency matrix. A threshold graph is a simple graph whose vertices can be ordered as $v_1, v_2, \ldots, v_n$, so that for each $2 \le i \le n$, vertex $v_i$ is either adjacent…
We present a general method for obtaining strong bounds for discrete optimization problems that is based on a concept of branching duality. It can be applied when no useful integer programming model is available, and we illustrate this with…