Related papers: Least Capacity Point of Triangles

We introduce a new framework for reconfiguration problems, and apply it to independent sets as the first example. Suppose that we are given an independent set $I_0$ of a graph $G$, and an integer $l \ge 0$ which represents a lower bound on…

In high-contrast composites, the electric (or stress) field may exhibit significant amplification in the narrow region between inclusions. The behavior of the solution depends on the distance $\epsilon$ between the inclusions, which tends…

In this paper, we consider the nonlinear constrained optimization problem (NCP) with constraint set $\{x \in \mathcal{X}: c(x) = 0\}$, where $\mathcal{X}$ is a closed convex subset of $\mathbb{R}^n$. We propose an exact penalty approach,…

We present some extensions of classical results that involve elements of the dual of Banach spaces, such as Bishop-Phelp's theorem and James' compactness theorem, but restricting to sets of functionals determined by geometrical properties.…

Answering a long-standing question in the theory of torsion modules, we show that weakly productively bounded domains are necessarily productively bounded. Moreover, we prove a twin result for the ideal lattice L of a domain equating weak…

On a weighted projective surface $\mathbb{P}(a,b,c)$ with $\min(a,b,c)\leq 4$, we compute lower bounds for the {\em effective threshold} of an ample divisor, in other words, the highest multiplicity a section of the divisor can have at a…

A rational triangle $T$ (one whose angles are rational multiples of $\pi$) unfolds to a translation surface $(X_T,\omega_T)$. The lattice triangle problem asks to classify those $T$ for which $(X_T,\omega_T)$ is a Veech (lattice) surface,…

In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…

A closed convex subset of a normed linear space is said to have the strong separation property if it can be strongly separated from every other disjoint closed and convex set by a closed hyperplane. In this paper we give some results on the…

We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…

Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…

In this paper, we revisit the problem of Differentially Private Stochastic Convex Optimization (DP-SCO) in Euclidean and general $\ell_p^d$ spaces. Specifically, we focus on three settings that are still far from well understood: (1) DP-SCO…

We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject to linear inequality and equality constraints. Approximate solutions can be found by solving a convexified version of the problem, in which…

Given a closed polygon P having n edges, embedded in R^d, we give upper and lower bounds for the minimal number of triangles t needed to form a triangulated PL surface in R^d having P as its geometric boundary. The most interesting case is…

We consider the intersection of a convex surface $\Ga$ with a periodic perforation of $\R^d$, which looks like a sieve, given by $T_\e = \bigcup_{k\in \Z^d}\{\e k+a_\e T\}$ where $T$ is a given compact set and $a_\e\ll \e$ is the size of…

We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time…

This is an innovative treatise on triangles, resting upon 1) 3-body problem techniques including mass-weighted relative Jacobi coordinates. 2) Part I's detailed layer-by-layer topological and geometrical study of Kendall-type shape spaces -…

Suppose $C$ is a compact, $n$-edged two-cell of the centered dual decomposition of a locally finite set in the hyperbolic plane, a coarsening of the Delaunay tessellation which was introduced in the author's prior work. We describe an…

The Kruskal-Katona theorem together with a theorem of Razborov determine the closure of the set of points defined by the homomorphism density of the edge and the triangle in finite graphs. The boundary of this region is a countable union of…

Let ${\cal P}$ be a set of $n$ points embedded in the plane, and let ${\cal C}$ be the complete Euclidean graph whose point-set is ${\cal P}$. Each edge in ${\cal C}$ between two points $p, q$ is realized as the line segment $[pq]$, and is…