English
Related papers

Related papers: Algorithmic Symplectic Packing

200 papers

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of…

Data Structures and Algorithms · Computer Science 2007-05-23 Sandor P. Fekete , Joerg Schepers , Jan C. van der Veen

There are two themes in the present paper. The first one is spelled out in the title, and is inspired by an attempt to find an analogue of Hersch-Yang-Yau estimate for $lambda_1$ of surfaces in symplectic category. In particular we prove…

dg-ga · Mathematics 2008-02-03 Leonid Polterovich

We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…

Computational Geometry · Computer Science 2011-12-01 Alina Ene , Sariel Har-Peled , Benjamin Raichel

Relations between the symplectically harmonic cohomology and the coeffective cohomology of a symplectic manifold are obtained. This is achieved through a generalization of the latter, which in addition allows us to provide a coeffective…

Symplectic Geometry · Mathematics 2018-07-18 Luis Ugarte , Raquel Villacampa

We prove that the space of symplectic embeddings of $n\geq 1$ standard balls into the standard complex projective plane $\mathbb{C}\mathrm{P}^2$ is homotopy equivalent to the configuration space of $n$ points in $\mathbb{C}\mathrm{P}^2$,…

Symplectic Geometry · Mathematics 2026-05-26 Sílvia Anjos , Jarek Kędra , Martin Pinsonnault

Multi-objective optimization problems require simultaneously optimizing two or more objective functions. Many studies have reported that the solution set of an M-objective optimization problem often forms an (M-1)-dimensional topological…

Optimization and Control · Mathematics 2018-12-14 Ken Kobayashi , Naoki Hamada , Akiyoshi Sannai , Akinori Tanaka , Kenichi Bannai , Masashi Sugiyama

In this paper we present a method to obtain resolutions of symplectic orbifolds arising from symplectic reduction of a Hamiltonian S^1-manifold at a regular value. As an application, we show that all isolated cyclic singularities of a…

Symplectic Geometry · Mathematics 2015-10-27 Klaus Niederkrüger , Federica Pasquotto

The Hamiltonian Monte Carlo method generates samples by introducing a mechanical system that explores the target density. For distributions on manifolds it is not always simple to perform the mechanics as a result of the lack of global…

Computation · Statistics 2019-04-22 Alessandro Barp , Anthony Kennedy , Mark Girolami

A $\lambda$-fold $r$-packing (multiple radius-$r$ covering) in a Hamming metric space is a code $C$ such that the radius-$r$ balls centered in $C$ cover each vertex of the space by not more (not less, respectively) than $\lambda$ times. The…

Discrete Mathematics · Computer Science 2021-05-25 Denis S. Krotov , Vladimir N. Potapov

For a closed 4-manifold X and closed 3-manifold M we investigate the smallest integer n (perhaps infinity) such that M embeds in the connected sum of n copies of X. It is proven that any lens space (or homology lens space) embeds…

Geometric Topology · Mathematics 2007-05-23 Allan L. Edmonds

We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional…

Data Structures and Algorithms · Computer Science 2007-05-23 Sandor P. Fekete , Ekkehard Koehler , Juergen Teich

The sphere packing problem is an old puzzle. We consider packings with m spheres in the unit cell (m-periodic packings). For the case m = 1 (lattice packings), Voronoi proved there are finitely many inequivalent local optima and presented…

Metric Geometry · Mathematics 2019-11-13 Alexei Andreanov , Yoav Kallus

We give an overview of the 2024 Computational Geometry Challenge targeting the problem \textsc{Maximum Polygon Packing}: Given a convex region $P$ in the plane, and a collection of simple polygons $Q_1, \ldots, Q_n$, each $Q_i$ with a…

Computational Geometry · Computer Science 2024-03-26 Sándor P. Fekete , Phillip Keldenich , Dominik Krupke , Stefan Schirra

In this paper, we study the 3D strip packing problem in which we are given a list of 3-dimensional boxes and required to pack all of them into a 3-dimensional strip with length 1 and width 1 and unlimited height to minimize the height used.…

Data Structures and Algorithms · Computer Science 2007-05-23 Xin Han , Kazuo Iwama , Guochuan Zhang

We give a method to resolve 4-dimensional symplectic orbifolds making use of techniques from complex geometry and gluing of symplectic forms. We provide some examples to which the resolution method applies.

Symplectic Geometry · Mathematics 2020-03-19 Lucía Martín-Merchán , Juan Rojo

We provide a closed, simply connected, symplectic $6$-manifold having infinitely many codimension $2$ symplectic submanifolds. These are mutually homologous but homotopy inequivalent, and furthermore, they cannot admit complex structures.…

Symplectic Geometry · Mathematics 2025-06-17 Takahiro Oba

Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…

Statistical Mechanics · Physics 2009-11-13 Antonio Trovato , Trinh X. Hoang , Jayanth R. Banavar , Amos Maritan

In this article we study proper symplectic and iso-symplectic embeddings of $4$--manifolds in $6$--manifolds. We show that a closed orientable smooth $4$--manifold admitting a Lefschetz fibration over $\C P^1$ admits a symplectic embedding…

Geometric Topology · Mathematics 2021-10-26 Dishant M. Pancholi , Francisco Presas

Klee's measure problem (computing the volume of the union of $n$ axis-parallel boxes in $\mathbb{R}^d$) is well known to have $n^{\frac{d}{2}\pm o(1)}$-time algorithms (Overmars, Yap, SICOMP'91; Chan FOCS'13). Only recently, a conditional…

Computational Geometry · Computer Science 2023-03-16 Egor Gorbachev , Marvin Künnemann

The purpose of this paper is to present some results on the existence of homologous, nonisotopic symplectic or lagrangian surfaces embedded in a simply connected symplectic 4-dimensional manifold.

Geometric Topology · Mathematics 2007-05-23 Stefano Vidussi