Related papers: Optimal Shape of a Blob
We show that for each $p \geq 1,$ the $L^p$-metric on the group of area-preserving diffeomorphisms of the two-sphere has infinite diameter. This solves the last open case of a conjecture of Shnirelman from 1985. Our methods extend to yield…
Let $\Bbbk$ be a perfect field with algebraic closure $\overline{\Bbbk}$. If $H$ is a subgroup of plane automorphisms over $\Bbbk$ and $p\in\overline{\Bbbk}^2$ is a point, we describe the subgroup consisting of plane automorphisms which…
We show there exists an L^p solution, for p>2, to the dbar-Neumann problem on an edge domain in C^2 for (0,1)-forms, and we explicitly compute the singularities, which are of complex logarithmic and arctangent type, along the edge, of the…
A typical computational geometry problem begins: Consider a set P of n points in R^d. However, many applications today work with input that is not precisely known, for example when the data is sensed and has some known error model. What if…
This paper investigates the solutions to the two-phase Serrin's problem, an overdetermined boundary value problem motivated by shape optimization. Specifically, we study the torsional rigidity of composite beams, where two distinct…
We will first solve the following problem analytically: given a piece of wire of specified length, we will find where the wire should be cut and bent to form two regular polygons not necessarily having the same number of sides, so that the…
We will investigate the value and inactive region of optimal stopping and one-sided singular control problems by focusing on two fundamental ratios. We shall see that these ratios unambiguously characterize the solution, although usually…
In this article, we address endpoint issues for the bilinear spherical maximal functions. We obtain borderline restricted weak type estimates for the well studied bilinear spherical maximal function…
There have been some major advances in the theory of optimal designs for interference models. However, the majority of them focus on one-dimensional layout of the block and the study for two-dimensional interference model is quite limited…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…
We consider the eigenvalue problem for the {\it fractional $p-$Laplacian} in an open bounded, possibly disconnected set $\Omega \subset \mathbb{R}^n$, under homogeneous Dirichlet boundary conditions. After discussing some regularity issues…
In this paper we address two different related problems. We first study the problem of finding a simple shortest path in a $d$-dimensional real space subdivided in several polyhedra endowed with different $\ell_p$-norms. This problem is a…
We consider the well-known following shape optimization problem: $$\lambda_1(\Omega^*)=\min_{\stackrel{|\Omega|=a} {\Omega\subset{D}}} \lambda_1(\Omega), $$ where $\lambda_1$ denotes the first eigenvalue of the Laplace operator with…
We consider a shape optimization problem for the persistence threshold of a biological species dispersing in a periodically fragmented environment, the unknown shape corresponding to the portion of the habitat which is favorable to the…
We propose a two-level structural optimization method for obtaining an approximate optimal shape of piecewise developable surface without specifying internal boundaries between surface patches. The condition for developability of a…
The optimal pair of two linear varieties is considered as a best approximation problem, namely the distance between a point and the difference set of two linear varieties. The Gram determinant allows to get the optimal pair in closed form.
The requirement of an $SL(2)$ duality symmetry, mixing the worldvolume field equations with Bianchi identities, leads to a highly nonlinear equation involving the transformation parameters and certain worldvolume currents. In general, this…
In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…
For a given polygonal region $P$, the Lawn Mowing Problem (LMP) asks for a shortest tour $T$ that gets within Euclidean distance 1 of every point in $P$; this is equivalent to computing a shortest tour for a unit-disk cutter $C$ that covers…
Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was…