Related papers: An Obstacle Problem for Elastic Curves: Existence …
Distortion maps allow one to solve the Decision Diffie-Hellman problem on subgroups of points on the elliptic curve. In the case of ordinary elliptic curves over finite fields, it is known that in most cases there are no distortion maps. In…
We study some percolation problems on the complete graph over $\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the…
We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…
We present a method for proving the existence of solutions to a class of one dimensional variational problems. The method is demonstrated by two examples of optimal interpolation problems which are motivated by engineering applications. In…
In the paper, we consider the obstacle problem, with one and two irregular barriers, for semilinear evolution equation involving measure data and operator corresponding to a semi-Dirichlet form. We prove the existence and uniqueness of…
For a one-dimensional wave equation, we consider a mixed problem in a curvilinear half-strip. The initial conditions have a first-kind discontinuity at one point. The mixed problem models the problem of a longitudinal impact on a finite…
This paper provides an overview of results, concerning longest or heaviest paths, in the area of random directed graphs on the integers along with some extensions. We study first-order asymptotics of heaviest paths allowing weights both on…
In a wide class of the so called Obstacle Problems of parabolic type it is shown how to improve the optimal regularity of the solution and as a consequence how to obtain space-time regularity of the corresponding free boundary.
Given two points in the plane, a set of obstacles defined by closed curves, and an integer $k$, does there exist a path between the two designated points intersecting at most $k$ of the obstacles? This is a fundamental and well-studied…
We use admissible covers to characterize irreducible stable curves that are $(d,h)$-elliptic, that is, that are limits of smooth curves admiting finite maps of degree-$d$ to smooth curves of genus $h\geq 1$.
We give three different proofs of the log-epiperimetric inequality at singular points for the obstacle problem. In the first, direct proof, we write the competitor explicitly; the second proof is also constructive, but this time the…
We study the set of curvature functions which a given compact manifold with boundary can possess. First, we prove that the sign demanded by the Gauss-Bonnet Theorem is a necessary and sufficient condition for a given function to be the…
Variational problems under uniform quasiconvex constraints on the gradient are studied. In particular, existence of solutions to such problems is proved as well as existence of lagrange multipliers associated to the uniform constraint. They…
We determine obstructedness or unobstructedness of (holomorphic) Poisson deformations of ruled surfaces over an elliptic curve.
We address highly dynamic distributed systems modeled by time-varying graphs (TVGs). We interest in proof of impossibility results that often use informal arguments about convergence. First, we provide a distance among TVGs to define…
Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…
In this paper we present a new framework for the solution of active contour models on graphs. With the use of the Finite Element Method we generalize active contour models on graphs and reduce the problem from a partial differential…
We introduce a stabilised finite element formulation for the Kirchhoff plate obstacle problem and derive both a priori and residual-based a posteriori error estimates using conforming $C^1$-continuous finite elements. We implement the…
Suppose we are given a pair of points $s, t$ and a set $S$ of $n$ geometric objects in the plane, called obstacles. We show that in polynomial time one can construct an auxiliary (multi-)graph $G$ with vertex set $S$ and every edge labeled…
We consider the obstacle problem with two irregular reflecting barriers for the Cauchy-Dirichlet problem for semilinear parabolic equations with measure data. We prove the existence and uniqueness of renormalized solutions of the problem…