Related papers: Bounds for totally separable translative packings …
We consider the optimal containment of polygonal regions within convex containers with the special property of 'orientedness' - an oriented region enables us to choose a preferred direction on the plane (this direction is not necessarily an…
In 1885, Fedorov discovered that a convex domain can form a lattice tiling of the Euclidean plane if and only if it is a parallelogram or a centrally symmetric hexagon. It is known that there is no other convex domain which can form a two-,…
We introduce a notion of fractional convexity that extends naturally the usual notion of convexity in the Euclidean space to a fractional setting. With this notion of fractional convexity, we study the fractional convex envelope inside a…
Giannopoulos, Hartzoulaki and Paouris asked in \cite{GHP} whether the best ratio between volume and surface area of convex bodies sharing a given orthogonal projection onto a fixed hyperplane is attained in the limit by a cylinder over the…
In 2006, Arveson resolved a long-standing problem by showing that for any element $x$ of a separable self-adjoint unital subspace $S\subseteq B(H)$, $\|x\|=\sup\|\pi(x)\|$, where $\pi$ runs over the boundary representations for $S$. Here we…
We explore the separability of point sets in the plane by a restricted-orientation convex hull, which is an orientation-dependent, possibly disconnected, and non-convex enclosing shape that generalizes the convex hull. Let $R$ and $B$ be…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
We study the Convex Set Disjointness (CSD) problem, where two players have input sets taken from an arbitrary fixed domain~$U\subseteq \mathbb{R}^d$ of size $\lvert U\rvert = n$. Their mutual goal is to decide using minimum communication…
Let M be a closed symplectic manifold of volume V. We say that M admits an unobstructed symplectic packing by balls if any collection of symplectic balls (of possibly different radii) of total volume less than V admits a symplectic…
Exploiting the relationship between 4-dimensional toric and semitoric integrable systems with Delzant and semitoric polygons, respectively, we develop techniques to compute certain equivariant packing densities and equivariant capacities of…
The justification of hydrodynamic limits in non-convex domains has long been an open problem due to the singularity at the grazing set. In this paper, we investigate the unsteady neutron transport equation in a general bounded domain with…
In a number of geophysical or planetological settings (Earth's inner core, a silicate mantle crystallizing from a magma ocean, or an ice shell surrounding a deep water ocean) a convecting crystalline layer is in contact with a layer of its…
A non-empty subset of a topological space is irreducible if whenever it is covered by the union of two closed sets, then already it is covered by one of them. Irreducible sets occur in proliferation: (1) every singleton set is irreducible,…
We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an $O(n\log n)$-time algorithm for the two-center…
For $0<p<+\infty$, we prove a global $W^{2,p}$-estimate for potentials of optimal transport maps between convex domains in the plane. Among the tools developed for that purpose are obliqueness in general convex domains and estimates for the…
We show that all density operators of 2$\times N$--dimensional quantum systems that remain invariant after partial transposition with respect to the first system are separable. Based on this criterion, we derive a sufficient separability…
The aim of this paper is to present a detailed and slightly modified version of the proof of the Lempert Theorem in the case of non-planar stronlgy linearly convex domains with C^2 smooth boundaries. The original Lempert's proof is…
We use Arveson's notion of strongly peaking representation to generalize uniqueness theorems for free spectrahedra and matrix convex sets which admit minimal presentations. A fully compressed separable operator system necessarily generates…
Neural codes serve as a language for neurons in the brain. Convex codes, which arise from the pattern of intersections of convex sets in Euclidean space, are of particular relevance to neuroscience. Not every code is convex, however, and…
For two planar convex bodies, $C$ and $D$, consider a packing $S$ of $n$ positive homothets of $C$ contained in $D$. We estimate the total perimeter of the bodies in $S$, denoted ${\rm per}(S)$, in terms of ${\rm per}(D)$ and $n$. When all…