Related papers: Least Capacity Point of Triangles
Given a triangle $\Delta$, we study the problem of determining the smallest enclosing and largest embedded isosceles triangles of $\Delta$ with respect to area and perimeter. This problem was initially posed by Nandakumar and was first…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
For a triangle $\Delta$, let (P) denote the problem of the existence of points in the plane of $\Delta$, that are at rational distance to the 3 vertices of $\Delta$. Answer to (P) is known to be positive in the following situation: $\Delta$…
Let $P$ be a finite set of points in the plane. A c-ordinary triangle is a set of three non-collinear points of $P$ such that each line spanned by the points contains at most $c$ points of $P$. We show that if $P$ is not contained in the…
We study the constraints of crossing symmetry and unitarity in general 3D Conformal Field Theories. In doing so we derive new results for conformal blocks appearing in four-point functions of scalars and present an efficient method for…
We consider the problem of geometric optimisation of the lowest eigenvalue of the Laplacian in the exterior of a compact set in any dimension, subject to attractive Robin boundary conditions. As an improvement upon our previous work…
The cardinality constrained optimization problem (CCOP) is an optimization problem where the maximum number of nonzero components of any feasible point is bounded. In this paper, we consider CCOP as a mathematical program with disjunctive…
In this paper we consider a minimization problem of the type $$ I_{\beta,p}(D;\Omega)=\inf\biggl\{\int_\Omega \lvert{D\phi}\rvert^pdx+\beta \int_{\partial^* \Omega}\lvert{\phi}\rvert^pd\mathcal{H}^{n-1},\; \phi \in W^{1,p}(\Omega),\;\phi…
The (unbounded version of the) Lempert function $l_D$ on a domain $D\subset\Bbb C^d$ does not usually satisfy the triangle inequality, but on bounded $\mathcal C^2$-smooth strictly pseudoconvex domains, it satisfies a quasi triangle…
Convex codes were recently introduced as models for neural codes in the brain. Any convex code $\C$ has an associated minimal embedding dimension $d(\C)$, which is the minimal Euclidean space dimension such that the code can be realized by…
We study the insulated conductivity problem with closely spaced insulators embedded in a homogeneous matrix where the current-electric field relation is the power law $J = |E|^{p-2}E$. The gradient of solutions may blow up as $\varepsilon$,…
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…
Assume we are given a set of parallel line segments in the plane, and we wish to place a point on each line segment such that the resulting point set maximizes or minimizes the area of the largest or smallest triangle in the set. We analyze…
For $p \in (1,N)$ and $\Omega \subseteq \mathbb{R}^N$ open, the Beppo-Levi space $\mathcal{D}^{1,p}_0(\Omega)$ is the completion of $C_c^{\infty}(\Omega)$ with respect to the norm $\left( \int_{\Omega}|\nabla u|^p \right)^ \frac{1}{p}.$…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We consider ILPs, where each variable corresponds to an integral point within a polytope $\mathcal{P}$, i. e., ILPs of the form $\min\{c^{\top}x\mid \sum_{p\in\mathcal P\cap \mathbb Z^d} x_p p = b, x\in\mathbb Z^{|\mathcal P\cap \mathbb…
We develop a least-squares method for computing the analytic capacity of compact plane sets with piecewise-analytic boundary. The method furnishes rigorous upper and lower bounds which converge to the true value of the capacity. Several…
We study an optimal stretching problem for certain convex domain in $\mathbb{R}^d$ ($d\geq 3$) whose boundary has points of vanishing Gaussian curvature. We prove that the optimal domain which contains the most positive (or least…
This paper provides necessary and sufficient optimality conditions for abstract constrained mathematical programming problems in locally convex spaces under new qualification conditions. Our approach exploits the geometrical properties of…