Related papers: Algorithmic Symplectic Packing
Let $n=2^k-1$ and $m=2^{k-2}$ for a certain $k\ge 3$. Consider the point-line geometry of $2m$-element subsets of an $n$-element set. Maximal singular subspaces of this geometry correspond to binary simplex codes of dimension $k$. For $k\ge…
In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one…
We prove that the topological complexity of every symplectically atoroidal manifold is equal to twice its dimension. This is the analogue for topological complexity of a result of Rudyak and Oprea, who showed that the…
The construction of optimal line packings in real or complex Euclidean spaces has shown to be a tantalizingly difficult task, because it includes the problem of finding maximal sets of equiangular lines. In the regime where equiangular…
We give the first approximation algorithm for mixed packing and covering semidefinite programs (SDPs) with polylogarithmic dependence on width. Mixed packing and covering SDPs constitute a fundamental algorithmic primitive with recent…
The optimal density function assigns to each symplectic toric manifold $M$ a number $0 < d \leq 1$ obtained by considering the ratio between the maximum volume of $M$ which can be filled by symplectically embedded disjoint balls and the…
How should you choose a good set of (say) 48 planes in four dimensions? More generally, how do you find packings in Grassmannian spaces? In this article I give a brief introduction to the work that I have been doing on this problem in…
We deepen the link between two classic areas of combinatorial optimization: augmentation and packing arborescences. We consider the following type of questions: What is the minimum number of arcs to be added to a digraph so that in the…
We study McDuff-Salamon's Problem 46 by showing that there exist closed manifolds of dimension $\geq 6$ admitting cohomologous symplectic forms with different Gromov widths. The examples are motivated by Ruan's early example of deformation…
An important area of combinatorial optimization is the study of packing and covering problems, such as Bin Packing, Multiple Knapsack, and Bin Covering. Those problems have been studied extensively from the viewpoint of approximation…
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…
This article introduces a novel, geometric approach for multi-manifold clustering (MMC), i.e. for clustering a collection of potentially intersecting, d-dimensional manifolds into the individual manifold components. We first compute a…
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…
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…
We consider generalizations of symplectic manifolds called n-plectic manifolds. A manifold is n-plectic if it is equipped with a closed, nondegenerate form of degree n+1. We show that higher structures arise on these manifolds which can be…
A venerable problem in combinatorics and geometry asks whether a given incidence relation may be realized by a configuration of points and lines. The classic version of this would ask for algebraic lines over some field or possibly real…
Dense packings have served as useful models of the structure of liquid, glassy and crystal states of matter, granular media, heterogeneous materials, and biological systems. Probing the symmetries and other mathematical properties of the…
The rational homology balls $B_n$ appeared in Fintushel and Stern's rational blow-down construction [FS2]. Later, Symington [Sy1], defined this operation in the symplectic category. In [Kh2], the author defined the inverse procedure, the…
After reviewing recent results on symplectic Lefschetz pencils and symplectic branched covers of CP^2, we describe a new construction of maps from symplectic manifolds of any dimension to CP^2 and the associated monodromy invariants. We…
In the (1-dimensional) bin packing problem, we are asked to pack all the given items into bins, each of capacity one, so that the number of non-empty bins is minimized. Zhu~[Chaos, Solitons \& Fractals 2016] proposed an approximation…