Related papers: An Obstacle Problem for Elastic Curves: Existence …
Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the…
In this note, we give a brief overview of obstacle problems for nonlocal operators, focusing on the applications to financial mathematics. The class of nonlocal operators that we consider can be viewed as infinitesimal generators of…
An obstacle representation of a graph $G$ consists of a set of polygonal obstacles and a drawing of $G$ as a visibility graph with respect to the obstacles: vertices are mapped to points and edges to straight-line segments such that each…
In the paper published in Duke Math. J. 1993, Y. Wen studied a second-order parabolic equation for inextensible elastic \emph{closed} curves in $\mathbb{R}^{2}$ toward inextensible elasticae. In this article, we extend Wen's result to the…
We consider the problem of finding an edge in a hidden undirected graph $G = (V, E)$ with $n$ vertices, in a model where we only allowed queries that ask whether or not a subset of vertices contains an edge. We study the non-adaptive model…
In this work we study the asymptotic behavior of solutions of the incompressible two-dimensional Euler equations in the exterior of a single smooth obstacle when the obstacle becomes very thin tending to a curve. We extend results by…
We prove existence, uniqueness, and regularity of viscosity solutions to the stationary and evolution obstacle problems defined by a class of nonlocal operators that are not stable-like and may have supercritical drift. We give sufficient…
This article combines various methods of analysis to draw a comprehensive picture of penalty approximations to the value, hedge ratio, and optimal exercise strategy of American options. While convergence of the penalised solution for…
In the Segment Intersection Graph Representation Problem, we want to represent the vertices of a graph as straight line segments in the plane such that two segments cross if and only if there is an edge between the corresponding vertices.…
We investigate the obstacle problem for a class of nonlinear equations driven by nonlocal, possibly degenerate, integro-differential operators, whose model is the fractional $p$-Laplacian operator with measurable coefficients. Amongst other…
In this paper we prove that a graph is a string graph (the intersection graph of curves in the plane) if and only if it admits a drawing in the plane with certain properties. This also allows us to define an algebraic obstruction, similar…
In a recent work, we introduced a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering $\leqslant$ on graphs. Towards this, we proposed the concepts of class obstruction,…
We study an extension of the Arrival problem, called Recursive Arrival, inspired by Recursive State Machines, which allows for a family of switching graphs that can call each other in a recursive way. We study the computational complexity…
We consider variational inequality solutions with prescribed gradient constraints for first order linear boundary value problems. For operators with coefficients only in $L^2$, we show the existence and uniqueness of the solution by using a…
In this paper we study Eulerian extensions with edge constraints and use the probabilistic method to establish sufficient conditions for a given connected graph to be a subgraph of a Eulerian graph containing $m$ edges, for a given number…
We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…
The article studies edge coverage for control flow graphs extended with explicit constraints. Achieving a given level of white-box coverage for a given code is a classic problem in software testing. We focus on designing test sets that…
This paper concerns fully nonlinear elliptic obstacle problems with oblique boundary conditions. We investigate the existence, uniqueness and $W^{2,p}$-regularity results by finding approximate non-obstacle problems with the same oblique…
Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded…
This paper is aimed at extending the graph limit with time dependent weights obtained in [1] for the case of a pairwise competition model introduced in [10], in which the equation governing the weights involves a weak singularity at the…