Related papers: Least Capacity Point of Triangles

Given $S= \{v_1, \dots, v_n\} \subset \mathbb{R} ^m$ and $p \in \mathbb{R} ^m$, testing if $p \in conv(S)$, the convex hull of $S$, is a fundamental problem in computational geometry and linear programming. First, we prove a Euclidean {\it…

Given the Laplacian on a planar, convex domain with piecewise linear boundary subject to mixed Dirichlet-Neumann boundary conditions, we provide a sufficient condition for its lowest eigenvalue to dominate the lowest eigenvalue of the…

A space is od-compact (resp. od-Lindel\"of) provided any cover by open dense sets has a finite (resp. countable) subcover. We first show with simple examples that these properties behave quite poorly under finite or countable unions. We…

We derive inner and outer bounds on the capacity region for a class of three-user partially connected interference channels. We focus on the impact of topology, interference alignment, and interplay between interference and noise. The…

An $\omega$-wedge is the closed set of points contained between two rays that are emanating from a single point (the apex), and are separated by an angle $\omega < \pi$. Given a convex polygon $P$, we place the $\omega$-wedge such that $P$…

We show that among antipodal $2d$-point configurations on the sphere $S^{d-1}$ in $\mathbb R^d$, the set of vertices of a regular cross-polytope inscribed in $S^{d-1}$ uniquely solves the best-covering problem (this is new for $d\geq 5$)…

For $d\in\{5,6\}$, we classify arrangements of $d + 2$ points in $\mathbf{RP}^{d-1}$ for which the minimum distance is as large as possible. To do so, we leverage ideas from matrix and convex analysis to determine the best possible codes…

The study is motivated by the known fact that, in the noncompact case, the main minimum-problem of the theory of interior capacities of condensers in a locally compact space is in general unsolvable, and this occurs even under very natural…

For a graph G, let p_i(G), i=0,...,3 be the probability that three distinct random vertices span exactly i edges. We call (p_0(G),...,p_3(G)) the 3-local profile of G. We investigate the set ${\cal S}_3 \subset \mathbb R^4$ of all vectors…

For a smoothly bounded pseudoconvex domain $D\subset{\Bbb C}^n$ of finite type with non-compact holomorphic automorphism group $\text{Aut}(D)$, we show that the set $S(D)$ of all boundary accumulation points for $\text{Aut}(D)$ is a compact…

Let $P$ be a finite point set in the plane. A \emph{$c$-ordinary triangle} in $P$ is a subset of $P$ consisting of three non-collinear points such that each of the three lines determined by the three points contains at most $c$ points of…

In this paper we consider the scale invariant shape functional $${\mathcal{F}}_{p,q}(\Omega)=\frac{\lambda_p^{1/p}(\Omega)}{\lambda_q^{1/q}(\Omega)},$$ where $1\le q<p\le+\infty$ and $\lambda_p(\Omega)$ (respectively $\lambda_q(\Omega)$) is…

We prove a Payne-Weinberger type inequality for the $p$-Laplacian Neumann eigenvalues ($p\ge 2$). The inequality provides the sharp upper bound on convex domains, in terms of the diameter alone, of the best constants in Poincar\'e…

We define and study exact, efficient representations of realization spaces Euclidean Distance Constraint Systems (EDCS), which includes Linkages and Frameworks. Each representation corresponds to a choice of Cayley parameters and yields a…

Point-cloud semantic segmentation underpins a wide range of critical applications. Although recent deep architectures and large-scale datasets have driven impressive closed-set performance, these models struggle to recognize or properly…

We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and…

We establish the capacity region for a class of discrete memoryless cognitive interference channel (DM-CIC) called cognitive-more-capable channel, and we show that superposition coding is the optimal encoding technique. This is the largest…

The capacitated tree cover problem with edge loads is a variant of the tree cover problem, where we are given facility opening costs, edge costs and loads, as well as vertex loads. We try to find a tree cover of minimum cost such that the…

We work in set-theory without choice ZF. Denoting by AC(N) the countable axiom of choice, we show in ZF+AC(N) that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak…

A set N is called a "weak epsilon-net" (with respect to convex sets) for a finite set X in R^d if N intersects every convex set that contains at least epsilon*|X| points of X. For every fixed d>=2 and every r>=1 we construct sets X in R^d…