Related papers: The anisotropic Bernstein problem
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 obtain a comparison result for solutions to nonlinear fully anisotropic elliptic problems by means of anisotropic symmetrization. As consequence we deduce a priori estimates for norms of the relevant solutions.
We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…
We study the minimal surface equation in the Heisenberg space, Nil_3. A geometric proof of non existence of minimal graphs over non convex, bounded and unbounded domains is achieved (our proof holds in the Euclidean space as well). We solve…
Comparison results for solutions to the Dirichlet problems for a class of nonlinear, anisotropic parabolic equations are established. These results are obtained through a semi-discretization method in time after providing estimates for…
Taking advantage of a recent critical point theorem, the existence of infinitely many solutions for an anisotropic problem with a parameter is established. More precisely, a concrete interval of positive parameters, for which the treated…
We prove some non-existence results for the asymptotic Plateau problem of minimal and area minimizing surfaces in the homogeneous space ${\widetilde{\mathrm{SL}}_2(\mathbb{R})}$ with isometry group of dimension 4, in terms of their…
We prove that $m$-dimensional Lipschitz graphs with anisotropic mean curvature bounded in $L^p$, $p>m$, are regular almost everywhere in every dimension and codimension. This provides partial or full answers to multiple open questions…
In this paper, we consider the minimal doubly resolving set problem in Hamming graphs, hypercubes and folded hypercubes. We prove that the minimal doubly resolving set problem in hypercubes is equivalent to the coin weighing problem. Then…
Nonlinear Poincar\'e inequalities are indispensable tools in the study of dimension reduction and low-distortion embeddings of graphs into metric spaces, and have found remarkable algorithmic applications. A basic open problem, posed by Jon…
We study the asymptotic Dirichlet problem for A-harmonic equations and for the minimal graph equation on a Cartan-Hadamard manifold M whose sectional curvatures are bounded from below and above by certain functions depending on the distance…
We prove discrete-to-continuum convergence for dynamical optimal transport on $\mathbb{Z}^d$-periodic graphs with energy density having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer,…
We solve the Dirichlet problem for fully nonlinear elliptic equations on Riemannian manifolds under essentially optimal structure conditions, especially with no restrictions to the curvature of the underlying manifold and the second…
Using Schauder's theory for linear elliptic partial differential equations in two independent variables and fundamental estimates for univalent mappings due to E. Heinz we establish an upper bound of the Gaussian curvature of…
Finding paths in graphs is a fundamental graph-theoretic task. In this work, we we are concerned with finding a path with some constraints on its length and the number of vertices neighboring the path, that is, being outside of and incident…
We present a variational framework for studying the existence and regularity of solutions to elliptic free boundary problems that do not necessarily minimize energy. As applications, we obtain mountain pass solutions of critical and…
It is well known that 3--regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3--regular graphs without reducing the girth, thereby proving that such graphs with…
In the area of beyond-planar graphs, i.e. graphs that can be drawn with some local restrictions on the edge crossings, the recognition problem is prominent next to the density question for the different graph classes. For 1-planar graphs,…
We present the first super-linear lower bounds for natural graph problems in the CONGEST model, answering a long-standing open question. Specifically, we show that any exact computation of a minimum vertex cover or a maximum independent set…
We show existence of solutions to the least gradient problem on the plane for boundary data in $BV(\partial\Omega)$. We also provide an example of a function $f \in L^1(\partial\Omega) \backslash (C(\partial\Omega) \cup…