Related papers: Algorithmic Symplectic Packing
We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…
In an earlier paper we explained how to convert the problem of symplectically embedding one 4-dimensional ellipsoid into another into the problem of embedding a certain set of disjoint balls into \CP^2 by using a new way to desingularize…
For each n greater than 7 we explicitly construct a sequence of Stein manifolds diffeomorphic to complex affine space of dimension n so that there is no algorithm to tell us in general whether a given such Stein manifold is symplectomorphic…
The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…
Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…
We completely solve the symplectic packing problem with equally sized balls for any rational, ruled, symplectic 4-manifolds. We give explicit formulae for the packing numbers, the generalized Gromov widths, the stability numbers, and the…
Optimal packing of objects in containers is a critical problem in various real-life and industrial applications. This paper investigates the two-dimensional packing of convex polygons without rotations, where only translations are allowed.…
We analyze the general problem of determining optimally dense packings, in a Euclidean or hyperbolic space, of congruent copies of some fixed finite set of bodies. We are strongly guided by examples of aperiodic tilings in Euclidean space…
We consider computational complexity of problems related to the fundamental group and the first homology group of (embeddable) $2$-complexes. We show, as an extension of an earlier work, that computing first homology of $2$-complexes is…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
We present a model development framework and numerical solution approach to the general problem-class of packing convex objects into optimized convex containers. Specifically, here we discuss the problem of packing ovals (egg-shaped…
We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…
This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knapsack, facility location and supplier selection problems. We…
We construct explicit maximal symplectic packings of minimal rational and ruled symplectic 4-manifolds by few balls in a very simple way.
The standard simplex in R^n, also known as the probability simplex, is the set of nonnegative vectors whose entries sum up to 1. They frequently appear as constraints in optimization problems that arise in machine learning, statistics, data…
We investigate the notion of symplectic divisorial compactification for symplectic 4-manifolds with either convex or concave type boundary. This is motivated by the notion of compactifying divisors for open algebraic surfaces. We give a…
We investigate approximation algorithms for several fundamental optimization problems on geometric packing. The geometric objects considered are very generic, namely $d$-dimensional convex fat objects. Our main contribution is a versatile…
We prove packing stability for any closed symplectic manifold with rational cohomology class. This will rely on a general symplectic embedding result for ellipsoids which assumes only that there is no volume obstruction and that the domain…
Optimization under the symplecticity constraint is an approach for solving various problems in quantum physics and scientific computing. Building on the results that this optimization problem can be transformed into an unconstrained problem…