Related papers: Shape Optimization Problems for Metric Graphs

Fixing an arithmetic lattice $\Gamma$ in an algebraic group $G$, the commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ with $[\Gamma : \Gamma \cap \Delta] [\Delta: \Gamma \cap \Delta] =…

This paper is concerned with a shape optimization problem governed by a non-smooth PDE, i.e., the nonlinearity in the state equation is not necessarily differentiable. We follow the functional variational approach of [40] where the set of…

For digraphs $D$ and $H$, a mapping $f: V(D)\dom V(H)$ is a {\em homomorphism of $D$ to $H$} if $uv\in A(D)$ implies $f(u)f(v)\in A(H).$ For a fixed directed or undirected graph $H$ and an input graph $D$, the problem of verifying whether…

We study the asymptotic Dirichlet problem for the minimal graph equation on a Cartan-Hadamard manifold $M$ whose radial sectional curvatures outside a compact set satisfy an upper bound $$K(P)\le - \frac{\phi(\phi-1)}{r(x)^2}$$ and a…

Many geometric and analytic properties of sets hinge on the properties of harmonic measure, notoriously missing for sets of higher co-dimension. The aim of this manuscript is to develop a version of elliptic theory, associated to a linear…

For $N\geq 4$, we let $\Omega$ to be a smooth bounded domain of $\mathbb{R}^N$, $\Gamma$ a smooth closed submanifold of $\Omega$ of dimension $k$ with $1\leq k \leq N-2$ and $h$ a continuous function defined on $\Omega$. We denote by…

Given a graph $\Gamma$, one may conside the set $X$ of its vertices as a metric space by assuming that all edges have length one. We consider two versions of homology theory of $\Gamma$ and their $K$-theory counterparts -- the $K$-theory of…

We consider minimizers of \[ F(\lambda_1(\Omega),\ldots,\lambda_N(\Omega)) + |\Omega|, \] where $F$ is a function strictly increasing in each parameter, and $\lambda_k(\Omega)$ is the $k$-th Dirichlet eigenvalue of $\Omega$. Our main result…

Shape optimization is commonly applied in engineering to optimize shapes with respect to an objective functional relying on PDE solutions. In this paper, we view shape optimization as optimization on Riemannian shape manifolds. We consider…

We consider a bounded domain $\Omega$ of $\mathbb{R}^N$, $N\geq 3$, and $h$ a continuous function on $\Omega$. Let $\Gamma$ be a closed curve contained in $\Omega$. We study existence of positive solutions $u\in H^1_0(\Omega)$ to the…

We consider minimizers of \[ F(\lambda_1(\Omega),\ldots,\lambda_N(\Omega)) + |\Omega|, \] where $F$ is a function nondecreasing in each parameter, and $\lambda_k(\Omega)$ is the $k$-th Dirichlet eigenvalue of $\Omega$. This includes, in…

Given a compact $E \subset \mathbb{R}^n$ and $s > 0$, the maximum distance problem seeks a compact and connected subset of $\mathbb{R}^n$ of smallest one dimensional Hausdorff measure whose $s$-neighborhood covers $E$. For $E\subset…

We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…

Graph isomorphism is an important problem as its worst-case time complexity is not yet fully understood. In this study, we try to draw parallels between a related optimization problem called point set registration. A graph can be…

The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of this work is to…

Given a graph with edge costs, the {\em power} of a node is themaximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider the following…

We optimize a selection of eigenvalues of the Laplace operator with Dirichlet or Neumann boundary conditions by adjusting the shape of the domain on which the eigenvalue problem is considered. Here, a phase-field function is used to…

We define a graph-based rate optimization problem and consider its computation, which provides a unified approach to the computation of various theoretical limits, including the (conditional) graph entropy, rate-distortion functions and…

We formulate and study an elliptic transmission-like problem combining local and nonlocal elements. Let $\mathbb{R}^{n}$ be separated into two components by a smooth hypersurface $\Gamma$. On one side of $\Gamma$, a function satisfies a…

A graph is geometric 1-planar if it admits a straight-line drawing where each edge is crossed at most once. We provide the first systematic study of the parameterized complexity of recognizing geometric 1-planar graphs. By substantially…