Related papers: Algorithmic Symplectic Packing

We discuss closed symplectic 4-manifolds which admit full symplectic packings by $N$ equal balls for large $N$'s. We give a homological criterion for recognizing such manifolds. As a corollary we prove that ${\Bbb C}P^2$ can be fully packed…

Packings of regular convex polygons ($n$-gons) that are sufficiently dense have been studied extensively in the context of modeling physical and biological systems as well as discrete and computational geometry. Former results were mainly…

We investigate spaces of symplectic embeddings of $n\leq 4$ balls into the complex projective plane. We prove that they are homotopy equivalent to explicitly described algebraic subspaces of the configuration spaces of $n$ points. We…

A symplectic semitoric manifold is a symplectic $4$-manifold endowed with a Hamiltonian $(S^1 \times \mathbb{R})$-action satisfying certain conditions. The goal of this paper is to construct a new symplectic invariant of symplectic…

Let M be a symplectic-toric manifold of dimension at least four. This paper investigates the so called symplectic ball packing problem in the toral equivariant setting. We show that the set of toric symplectic ball packings of M admits the…

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 present an optimization model defined on the manifold of the set of stochastic matrices. Geometrically, the model is akin to identifying a maximum-volume $n$-dimensional simplex that has a given barycenter and is enclosed by the…

Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in a homology class, we consider the problem of computing a…

Let $B^{2n}(R)$ denote the closed $2n$-dimensional symplectic ball of area $R$, and let $\Sigma_g(L)$ be a closed symplectic surface of genus $g$ and area $L$. We prove that there is a symplectic embedding $\bigsqcup_{i=1}^k B^4(R_i) \times…

Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…

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…

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…

Optimization tasks are crucial in statistical machine learning. Recently, there has been great interest in leveraging tools from dynamical systems to derive accelerated and robust optimization methods via suitable discretizations of…

We prove that symplectic ball packing stability holds for every compact, connected symplectic $4$-manifold with smooth boundary. This follows from a stronger result: the full volume of any such manifold can be filled by a single symplectic…

The main goal of this paper is to give constructive proofs of several existence results for symplectic embeddings. The strong relation between symplectic packings and singular symplectic curves, which can be derived from McDuff's inflations…

In this paper we obtain new obstructions to symplectic embeddings of the four-dimensional polydisk $P(a,1)$ into the ball $B(c)$ for $2\leq a<\frac{\sqrt{7}-1} {\sqrt{7}-2} \approx 2.549$, extending work done by Hind-Lisi and Hutchings.…

This work presents two novel approaches for the symplectic model reduction of high-dimensional Hamiltonian systems using data-driven quadratic manifolds. Classical symplectic model reduction approaches employ linear symplectic subspaces for…

During the last few years several new results on packing problems were obtained using a blend of tools from semidefinite optimization, polynomial optimization, and harmonic analysis. We survey some of these results and the techniques…

In this paper we show that every degree 2 homology class of a 2n-dimensional symplectic manifold is represented by an immersed symplectic surface if it has positive symplectic area. Moreover, the symplectic surface can be chosen to be…

The problem of packing equal circles in a circle is a classic and famous packing problem, which is well-studied in academia and has a variety of applications in industry. This problem is computationally challenging, and researchers mainly…