Related papers: Algorithmic Symplectic Packing
Fitting an unknown number of hyperplanes to data is a fundamental yet challenging problem in machine learning, characterized by its non-convexity, non-differentiability, and unknown model order. Existing approaches often struggle with local…
We study symplectic structures on four-dimensional small covers. Our main result shows that every symplectic four-dimensional small cover is aspherical. We then classify symplectic small covers over products of two polygons, proving that…
Given an SO(3)-bundle with connection, the associated two-sphere bundle carries a natural closed 2-form. Asking that this be symplectic gives a curvature inequality first considered by Reznikov. We study this inequality in the case when the…
We consider two categories related to symplectic manifolds: 1. Objects are symplectic manifolds and morphisms are symplectic embeddings. 2. Objects are symplectic manifolds endowed with compatible almost complex structure and morphisms are…
In this paper, we study the problem of hyperball (hypersphere) packings in $n$-dimensional hyperbolic space ($n \ge 4$). We prove that to each $n$-dimensional congruent saturated hyperball packing, there is an algorithm to obtain a…
Numerous problems in optics, quantum physics, stability analysis, and control of dynamical systems can be brought to an optimization problem with matrix variable subjected to the symplecticity constraint. As this constraint nicely forms a…
We construct the symplectic resolution of a symplectic orbifold whose isotropy locus consists of disjoint submanifolds with homogeneous isotropy, that is, all its points have the same isotropy groups.
A finite volume symplectic manifold is said to have "packing stability" if the only obstruction to symplectically embedding sufficiently small balls is the volume obstruction. Packing stability has been shown in a variety of cases and it…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
Low-rank optimization problems with sparse simplex constraints involve variables that must satisfy nonnegativity, sparsity, and sum-to-1 conditions, making their optimization particularly challenging due to the interplay between low-rank…
Given a set of squares and a strip of bounded width and infinite height, we consider a square strip packaging problem, which we call the square independent packing problem (SIPP), to minimize the strip height so that all the squares are…
Given two four-dimensional symplectic manifolds, together with knots in their boundaries, we define an ``anchored symplectic embedding'' to be a symplectic embedding, together with a two-dimensional symplectic cobordism between the knots…
We present a general and modular algorithmic framework for path planning of robots. Our framework combines geometric methods for exact and complete analysis of low-dimensional configuration spaces, together with practical, considerably…
We use symplectic cohomology to study the non-uniqueness of symplectic structures on the smooth manifolds underlying affine varieties. Starting with a Lefschetz fibration on such a variety and a finite set of primes, the main new tool is a…
In this note, we propose a symplectic algorithm for the stable manifolds of the Hamilton-Jacobi equations combined with an iterative procedure in [Sakamoto-van~der Schaft, IEEE Transactions on Automatic Control, 2008]. Our algorithm…
We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…
We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…
The symplectic Stiefel manifold, denoted by $\mathrm{Sp}(2p,2n)$, is the set of linear symplectic maps between the standard symplectic spaces $\mathbb{R}^{2p}$ and $\mathbb{R}^{2n}$. When $p=n$, it reduces to the well-known set of $2n\times…
Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines. A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest…