Related papers: Algorithmic Symplectic Packing
The topology of symplectic 4-manifolds is related to that of singular plane curves via the concept of branched covers. Thus, various classification problems concerning symplectic 4-manifolds can be reformulated as questions about singular…
In this paper we describe a method to establish when a symplectic manifold $M$ with semi-free Hamiltonian $S^{1}$-action is unique up to isomorphism (equivariant symplectomorphism). This will rely on a study of the symplectic topology of…
We develop an algorithm to construct new self-similar space-filling packings of spheres. Each topologically different configuration is characterized by its own fractal dimension. We also find the first bi-cromatic packing known up to now.
In rectangle packing problems we are given the task of placing axis-aligned rectangles in a given plane region, so that they do not overlap with each other. In Maximum Weight Independent Set of Rectangles (MWISR), their position is given…
To address the dual challenges of the curse of dimensionality and the difficulty in separating intra-cluster and inter-cluster structures in high-dimensional manifold embedding, we proposes an Adaptive Multi-Scale Manifold Embedding (AMSME)…
Cutting and packing problems are present in many, at first glance unconnected, areas, therefore it's beneficial to have a good understanding of their underlying structure, to select proper techniques for finding solutions. Cutting and…
We propose a framework for modeling and solving low-rank optimization problems to certifiable optimality. We introduce symmetric projection matrices that satisfy $Y^2=Y$, the matrix analog of binary variables that satisfy $z^2=z$, to model…
Although many machine learning algorithms involve learning subspaces with particular characteristics, optimizing a parameter matrix that is constrained to represent a subspace can be challenging. One solution is to use Riemannian…
We study symplectic groups and indefinite orthogonal groups over involutive, possibly noncommutative, algebras $(A, \sigma)$. In the case when the algebra $(A, \sigma)$ is Hermitian, or the complexification $(A_{\mathbb{C}},…
We analyze four-dimensional symplectic manifolds of type $X=S^1 \times M^3$ where $M^3$ is an open $3$-manifold admitting inequivalent fibrations leading to inequivalent symplectic structures on $X$. For the case where $M^3 \subset S^3$ is…
In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…
The aim of this paper is to highlight recent progress in using conic optimization methods to study geometric packing problems. We will look at four geometric packing problems of different kinds: two on the unit sphere -- the kissing number…
A polysymplectic structure is a vector-valued symplectic form, that is, a closed nondegenerate 2-form with values in a vector space. We first outline the polysymplectic Hamiltonian formalism with coefficients in a vector space $V$, then…
We introduce a streamlined procedure for constructing small symplectic $4$-manifolds via contact gluing, based on a technique invented by David Gay around 2000. We give several applications of this procedure, which produced results…
The symmetries of surfaces which can be embedded into the symmetries of the 3-dimensional Euclidean space $\mathbb{R}^3$ are easier to feel by human's intuition. We give the maximum order of finite group actions on $(\mathbb{R}^3, \Sigma)$…
Let C be the class of compact 2n-dimensional symplectic manifolds M for which the first or (n-1) Chern class vanish. We point out an integer optimization problem to find a lower bound B(n) on the number of equilibrium points of…
The real symplectic Stiefel manifold is the manifold of symplectic bases of symplectic subspaces of a fixed dimension. It features in a large variety of applications in physics and engineering. In this work, we study this manifold with the…
Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation…
This paper is a contribution to piecewise linear (PL) symplectic topology. We define the notion of PL symplectic manifold as being a combinatorial manifold endowed with a piecewise constant Whitney symplectic form and investigate possible…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…