Related papers: Simultaneous packing and covering in the two-dimen…
This paper first proposes an N-block PCPM algorithm to solve N-block convex optimization problems with both linear and nonlinear constraints, with global convergence established. A linear convergence rate under the strong second-order…
In 2021, Ordentlich, Regev and Weiss made a breakthrough that the lattice covering density of any $n$-dimensional convex body is upper bounded by $cn^{2}$, improving on the best previous bound established by Rogers in 1959. However, for the…
The article presents the mathematical sequences describing circle packing densities in four different geometric configurations involving a hexagonal lattice based equal circle packing in the Euclidian plane. The calculated sequences take…
The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…
We study the two-dimensional Ulam's floating body problem for convex domains with perimetral density $\sigma=\tfrac16$. Using the framework of Zindler carousels, we reduce the problem to a two-dimensional dynamical system associated with an…
This paper addresses a two-player target defense game in the $n$-dimensional Euclidean space where an attacker attempts to enter a closed convex target set while a defender strives to capture the attacker beforehand. We provide a complete…
Convex optimization is a well-established research area with applications in almost all fields. Over the decades, multiple approaches have been proposed to solve convex programs. The development of interior-point methods allowed solving a…
We study the isoperimetric problem for Euclidean space endowed with a continuous density. In dimension one, we characterize isoperimetric regions for a unimodal density. In higher dimensions, we prove existence results and we derive…
The aim of this paper is to consider the Lobachevskii geometry analog of a well-known Euclidian problem; namely: to find a triangle with two fixed sides and the maximum area
We define and solve the toric version of the symplectic ball packing problem, in the sense of listing all 2n-dimensional symplectic-toric manifolds which admit a perfect packing by balls embedded in a symplectic and torus equivariant…
We continue the study of optimal chordal packings, with emphasis on packing subspaces of dimension greater than one. Following a principle outlined in a previous work, where the authors use maximal affine block designs and maximal sets of…
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…
This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one…
We study two optimization problems for positive definite functions on Euclidean space with restrictions on their support and sign: the Turan problem and the Delsarte problem. These problems have been studied also for their connections to…
We study the duality of moduli of k- and (n-k)-dimensional slices of euclidean n-cubes, and establish the optimal upper bound 1.
We consider an $n$-variate monomial function that is restricted both in value by lower and upper bounds and in domain by two homogeneous linear inequalities. Such functions are building blocks of several problems found in practical…
The convex body isoperimetric conjecture in the plane asserts that the least perimeter to enclose given area inside a unit disk is greater than inside any other convex set of area $\pi$. In this note we confirm two cases of the conjecture:…
We study the sphere packing problem in Euclidean space where we impose additional constraints on the separations of the center points. We prove that any sphere packing in dimension $48$, with spheres of radii $r$, such that no two centers…
We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…
The paper deals with the optimal control problem described by second order evolution differential inclusions; to this end first we use an auxiliary problem with second order discrete and discrete-approximate inclusions. Then applying…