Related papers: An Obstacle Problem for Elastic Curves: Existence …
We study the parameterized complexity of interdiction problems in graphs. For an optimization problem on graphs, one can formulate an interdiction problem as a game consisting of two players, namely, an interdictor and an evader, who…
We prove the existence of embedded closed constant curvature curves on convex surfaces.
An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them…
We establish nonexistence conditions for nonnegative nontrivial solutions to a class of semilinear parabolic equations with a positive potential on weighted graphs, extending results in arXiv:2404.12058 [math.AP] to a broader setting that…
We consider the dynamics of point particles which are confined to a bounded, possibly nonconvex domain $\Omega$. Collisions with the boundary are described as purely elastic collisions. This turns the description of the particle dynamics…
This paper studies the obstructions to deforming a map from a complex variety to another variety which is an immersion of codimension one. We extend the classical notion of semiregularity of subvarieties to maps between varieties, and show…
We study optimization problems for partially hinged rectangular plates, modeling bridge roadways, in the presence of real and artificial obstacles. Real obstacles represent structural constraints to avoid, while artificial ones are…
We study the length-preserving elastic flow of curves in arbitrary codimension with free boundary on hypersurfaces. This constrained gradient flow is given by a nonlocal evolution equation with nonlinear higher-order boundary conditions. We…
In this article, we present a method to find a solution to a one-dimensional nonlocal conservation law that respects a space-dependent mapping, referred to as the obstacle. This is achieved by generalizing existing results for the local…
The computation of short paths in graphs with arc lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally valuable. For the setting where each vertex is assigned to a…
In this paper, we classify the class of constant weighted curvature curves in the plane with a log-linear density, or in other words, classify all traveling curved fronts with a constant forcing term in $\Bbb R^2.$ The classification gives…
We consider the forced motion of a relativistic particle constrained on a curve and present sufficient conditions for periodic oscillations by means of an illustrative geometrical approach. Obtained result is illustrated by a few examples…
Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the…
The problem of finding paths in temporal graphs has been recently considered due to its many applications. In this paper we consider a variant of the problem that, given a vertex-colored temporal graph, asks for a path whose vertices have…
Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…
We study some regularity issues for solutions of non-autonomous obstacle problems with $(p,q)$-growth. Under suitable assumptions, our analysis covers the main models available in the literature.
We prove the existence and $C^{1,\alpha}$ regularity of solutions to nonlocal fully nonlinear elliptic double obstacle problems. We also obtain boundary regularity for these problems. The obstacles are assumed to be Lipschitz…
We minimize elastic energies on framed curves which penalize both curvature and torsion. We also discuss critical points using the infinite dimensional version of the Lagrange multipliers' method. Finally, some examples arising from the…
A developable cone ("d-cone") is the shape made by an elastic sheet when it is pressed at its center into a hollow cylinder by a distance $\epsilon$. Starting from a nonlinear model depending on the thickness $h > 0$ of the sheet, we prove…
We summarise three applications of the obstacle problem to membrane contact, elastoplastic torsion and cavitation modelling, and show how the resulting models can be solved using mixed finite elements. It is challenging to construct fixed…