Related papers: An Obstacle Problem for Elastic Curves: Existence …
A Helly circular-arc graph is the intersection graph of a set of arcs on a circle having the Helly property. We introduce essential obstacles, which are a refinement of the notion of obstacles, and prove that essential obstacles are…
We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting…
A space-discretization for the elastic flow of inextensible curves is devised and quasi-optimal convergence of the corresponding semi-discrete problem is proved for a suitable discretization of the nonlinear inextensibility constraint.…
In [Lacave, IHP, ana, to appear (2008)] the author considered the two dimensional Euler equations in the exterior of a thin obstacle shrinking to a curve and determined the limit velocity. In the present work, we consider the same problem…
In this paper we consider the existence of positive solutions for a singular elliptic problem involving an asymtotically linear nonlinearity and depending on one positive parameter. Using variational methods, together with comparison…
We consider a flow by powers of Gauss curvature under the obstruction that the flow cannot penetrate a prescribed region, so called an obstacle. For all dimensions and positive powers, we prove the optimal curvature bounds of solutions and…
We consider the evolution of fronts by mean curvature in the presence of obstacles. We construct a weak solution to the flow by means of a variational method, corresponding to an implicit time-discretization scheme. Assuming the regularity…
In this paper we provide the non-existence criterion for the so-called maximizing curves of odd degrees. Furthermore, in the light of our criterion, we define a new class of plane curves that generalizes the notion of maximizing curves…
We study semilinear elliptic inequalities with a potential on infinite graphs. Given a distance on the graph, we assume an upper bound on its Laplacian, and a growth condition on a suitable weighted volume of balls. Under such hypotheses,…
An obstacle representation of a graph $G$ consists of a set of pairwise disjoint simply-connected closed regions and a one-to-one mapping of the vertices of $G$ to points such that two vertices are adjacent in $G$ if and only if the line…
We prove optimal regularity and a detailed analysis of the free boundary of the solutions to the thin obstacle problem for nonparametric minimal surfaces with flat obstacles.
An \emph{obstacle representation} of a graph $G$ is a straight-line drawing of $G$ in the plane together with a collection of connected subsets of the plane, called \emph{obstacles}, that block all non-edges of $G$ while not blocking any of…
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…
For every $p\in\mathbb{R}$, we study $p$-elastic curves in the hyperbolic plane $\mathbb{H}^2$ and in the de Sitter $2$-space $\mathbb{H}_1^2$. We analyze the existence of closed $p$-elastic curves with nonconstant curvature showing that in…
We study smooth maps between smooth manifolds with only fold points as their singularities, and clarify the obstructions to the existence of such a map in a given homotopy class for certain dimensions. The obstructions are described in…
The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to…
We study the obstacle problem associated to mean curvature flow. We add to the geometric vanishing-viscosity approximation of Evans and Spruck a singular perturbation that penalizes the violation of the constraint, and pass to the limit.…
In arXiv:2205.02920 a variant of the classical elastic flow for closed curves in $\mathbb{R}^{n}$ was introduced, that is more suitable for numerical purposes. Here we investigate the long-time properties of such evolution demonstrating…
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 construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an…