Related papers: Algorithmic Symplectic Packing
We study the two-dimensional hierarchical rectangle packing problem, motivated by applications in analog integrated circuit layout, facility layout, and logistics. Unlike classical strip or bin packing, the dimensions of the container are…
We define a class of symplectic fibrations called symplectic configurations. They are natural generalization of Hamiltonian fibrations. Their geometric and topological properties are investigated. We are mainly concentrated on integral…
Clustering is a hard discrete optimization problem. Nonconvex approaches such as low-rank semidefinite programming (SDP) have recently demonstrated promising statistical and local algorithmic guarantees for cluster recovery. Due to the…
We compute the homology of the matching complex $M(\Gamma)$, where $\Gamma$ is the complete hypergraph on $n\geq 2$ vertices, and analyse the $S_n$-representations carried by this homology. These results are achieved using standard…
We classify four-dimensional manifolds endowed with symplectic pairs admitting embedded symplectic spheres with non-negative self-intersection, following the strategy of McDuff's classification of rational and ruled symplectic four…
Let M be a closed symplectic manifold of volume V. We say that the symplectic packings of M by ellipsoids are unobstructed if any collection of disjoint symplectic ellipsoids (possibly of different sizes) of total volume less than V admits…
Consider the configuration spaces of manifolds. We give a precise formula for the integral cohomological dimension (the degree of top non-trivial integral cohomology group) of unordered configuration spaces of manifolds with non-trivial…
By a result of Kedra and Pinsonnault, we know that the topology of groups of symplectomorphisms of symplectic 4-manifolds is complicated in general. However, in all known (very specific) examples, the rational cohomology rings of…
This note initiates an investigation of packing links into a region of Euclidean space to achieve a maximal density subject to geometric constraints. The upper bounds obtained apply only to the class of homotopically essential links and…
Spectral clustering is a fundamental technique in the field of data mining and information processing. Most existing spectral clustering algorithms integrate dimensionality reduction into the clustering process assisted by manifold learning…
We answer a question of Oprea-Tralle on the realizability of symplectic algebras by symplectic manifolds in dimensions divisible by four, along with a question of Lupton-Oprea in all even dimensions. This will also allow us to address, in…
We present a handlebody construction of small symplectic caps, and hence of small closed symplectic 4-manifolds. We use this to construct handlebody descriptions of symplectic embeddings of rational homology balls in…
The 2024 edition of the CG:SHOP Challenge focused on the knapsack polygonal packing problem. Each instance consists of a convex polygon known as the container and a multiset of items, where each item is a simple polygon with an associated…
The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…
In the present paper we study the variation of the dimensions $h_k$ of spaces of symplectically harmonic cohomology classes (in the sense of Brylinski) on closed symplectic manifolds. We give a description of such variation for all…
The main result of this paper is the construction of a bijection of the set of words in so-called standard order of length $n$ formed by four different letters and the set $\mathbb{N}^n$ of all subspaces of a fixed $n$-dimensional maximal…
We give finiteness results and some classifications up to diffeomorphism of minimal strong symplectic fillings of Seifert fibered spaces over S^2 satisfying certain conditions, with a fixed natural contact structure. In some cases we can…
A remarkable coincidence has led to the discovery of a family of packings of (m^2+m-2) m/2-dimensional subspaces of m-dimensional space, whenever m is a power of 2. These packings meet the ``orthoplex bound'' and are therefore optimal.
We study moduli spaces of meromorphic connections (with arbitrary order poles) over Riemann surfaces together with the corresponding spaces of monodromy data (involving Stokes matrices). Natural symplectic structures are found and described…
The proportional fair resource allocation problem is a major problem studied in flow control of networks, operations research, and economic theory, where it has found numerous applications. This problem, defined as the constrained…