Related papers: Least Capacity Point of Triangles

For an integral convex polytope $\mathcal{P} \subset \mathbb{R}^d$, we recall $L_\mathcal{P}(n)=|n\mathcal{P} \cap \mathbb{Z}^d|$ the Ehrhart polynomial of $\mathcal{P}$. Let $g_r(\mathcal{P})$ be the $r$th coefficients of…

In this note we study the open-point topological games in order to analyze the least upper bound for density of dense subsets of a topological space. This way we may also analyze the behavior of such cardinal invariants in taking products…

Tensors decompositions are a class of tools for analysing datasets of high dimensionality and variety in a natural manner, with the Canonical Polyadic Decomposition (CPD) being a main pillar. While the notion of CPD is closely intertwined…

We study the constant $\mathscr{C}_p$ defined as the smallest constant $C$ such that $|f(0)|^p \leq C\|f\|_p^p$ holds for every function $f$ in the Paley-Wiener space $PW^p$. Brevig, Chirre, Ortega-Cerd\`a, and Seip have recently shown that…

Suppose we count the positive integer lattice points beneath a convex decreasing curve in the first quadrant having equal intercepts. Then stretch in the coordinate directions so as to preserve the area under the curve, and again count…

This paper provides characterizations of the weak solutions of optimization problems where a given vector function $F,$ from a decision space $X$ to an objective space $Y$, is "minimized" on the set of elements $x\in C$ (where $C\subset X$…

This article is devoted to characterize all possible effective behaviors of composite materials by means of periodic homogenization. This is known as a $G$-closure problem. Under convexity and $p$-growth conditions ($p>1$), it is proved…

Let f be a function meromorphic in a neighborhood of infinity. The central problem in the present investigation is to find the largest domain D \subset C to which the function f can be extended in a meromorphic and singlevalued manner.…

We consider the problem of counting straight-edge triangulations of a given set $P$ of $n$ points in the plane. Until very recently it was not known whether the exact number of triangulations of $P$ can be computed asymptotically faster…

This paper details an approach to linearise differentiable but non-convex collision avoidance constraints tailored to convex shapes. It revisits introducing differential collision avoidance constraints for convex objects into an optimal…

Optimal transport from the volume measure to a convex combination of Dirac measures yields a tessellation of a Riemannian manifold into pieces of arbitrary relative size. This tessellation is studied for the cost functions…

Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.

The Convex Envelope of a given function was recently characterized as the solution of a fully nonlinear Partial Differential Equation (PDE). In this article we study a modified problem: the Dirichlet problem for the underlying PDE. The main…

We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…

We prove a sharp upper bound on convex domains, in terms of the diameter alone, of the best constant in a class of weighted Poincar\'e inequalities. The key point is the study of an optimal weighted Wirtinger inequality.

The Performance Estimation Problem (PEP) approach consists in computing worst-case performance bounds on optimization algorithms by solving an optimization problem: one maximizes an error criterion over all initial conditions allowed and…

We address the question of which convex shapes, when packed as densely as possible under certain restrictions, fill the least space and leave the most empty space. In each different dimension and under each different set of restrictions,…

We consider the following eigenvalue optimization in the composite membrane problem with fractional Laplacian: given a bounded domain $\Omega\subset \mathbb{R}^n$, $\alpha>0$ and $0<A<|\Omega|$, find a subset $D\subset \Omega$ of area $A$…

In the optimization of convex domains under a PDE constraint numerical difficulties arise in the approximation of convex domains in $\mathbb{R}^3$. Previous research used a restriction to rotationally symmetric domains to reduce shape…

We use the conformal bootstrap to perform a precision study of the operator spectrum of the critical 3d Ising model. We conjecture that the 3d Ising spectrum minimizes the central charge c in the space of unitary solutions to crossing…