Related papers: A nongraphical obstacle problem for elastic curves
We study positivity-preserving properties for the elastic flow of non-compact, complete curves in Euclidean space. Despite the fact that the canonical elastic energy is infinite in this context, we extend our recent work based on the…
Motivated by recent interest in elastic problems in which the target space is non-Euclidean, we study a limit where local rest distances within an elastic body are incompatible, yet close to, distances within the ambient space.…
For a given domain $\Omega \subset \Bbb{R}^n$, we consider the variational problem of minimizing the $L^1$-norm of the gradient on $\Omega$ of a function $u$ with prescribed continuous boundary values and satisfying a continuous lower…
For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…
We study the weighted improper coloring problem, a generalization of defective coloring. We present some hardness results and in particular we show that weighted improper coloring is not fixed-parameter tractable when parameterized by…
Many extremal problems for graphs have threshold graphs as their extremal examples. For instance the current authors proved that for fixed $k\ge 1$, among all graphs on $n$ vertices with $m$ edges, some threshold graph has the fewest…
Embedding geometries in structured grids allows a simple treatment of complex objects in fluid simulations. Various methods for embedding geometries are available. The commonly used Brinkman-volume-penalization models geometries as porous…
The edges of a graph are assigned weights and passage times which are assumed to be positive integers. We present a parallel algorithm for finding the shortest path whose total weight is smaller than a pre-determined value. In each step the…
We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.
Existence of stationary solutions to a nonlocal fourth-order elliptic obstacle problem arising from the modelling of microelectromechanical systems with heterogeneous dielectric properties is shown. The underlying variational structure of…
The main goal of this article is to understand the trace properties of nonlocal minimal graphs in~$\R^3$, i.e. nonlocal minimal surfaces with a graphical structure. We establish that at any boundary points at which the trace from inside…
Covering and partitioning the edges of a graph into cliques are classical problems at the intersection of combinatorial optimization and graph theory, having been studied through a range of algorithmic and complexity-theoretic lenses.…
We consider whether minimizers for total variation regularization of linear inverse problems belong to $L^\infty$ even if the measured data does not. We present a simple proof of boundedness of the minimizer for fixed regularization…
In this paper, we delve into the intricacies of boundary stabilization for the linearized KP-II equation within the constraints of a bounded domain, a phenomenon known as ``critical length." Our primary aim is to design a feedback law that…
We study self-contact phenomena in elastic rods that are constrained to lie on a cylinder. By choosing a particular set of variables to describe the rod centerline the variational setting is made particularly simple: the strain energy is a…
Using classical differential geometry, the problem of elastic curves and surfaces in the presence of long-range interactions $\Phi$, is posed. Starting from a variational principle, the balance of elastic forces and the corresponding…
In this paper, we propose and analyze a finite element discretization for the computation of fractional minimal graphs of order~$s \in (0,1/2)$ on a bounded domain $\Omega$. Such a Plateau problem of order $s$ can be reinterpreted as a…
We consider the problem of adding a fixed number of new edges to an undirected graph in order to minimize the diameter of the augmented graph, and under the constraint that the number of edges added for each vertex is bounded by an integer.…
Building on our previous work, we classify all planar $p$-elasticae under the pinned boundary condition, and then obtain uniqueness and geometric properties of global minimizers. As an application we establish a Li--Yau type inequality for…
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations.…