Related papers: Algorithmic Symplectic Packing

We introduce an efficient and scalable method for density-based multi-material topology optimization, integrating classical mirror descent techniques with point-wise polytopal design constraints. Such constraints arise naturally in this…

We show that any closed oriented 3-manifold can be topologically embedded in some simply-connected closed symplectic 4-manifold, and that it can be made a smooth embedding after one stabilization. As a corollary of the proof we show that…

A study of symplectic actions of a finite group $G$ on smooth 4-manifolds is initiated. The central new idea is the use of $G$-equivariant Seiberg-Witten-Taubes theory in studying the structure of the fixed-point set of these symmetries.…

We consider compact connected six dimensional symplectic manifolds with Hamiltonian SU(2) or SO(3) actions with cyclic principal stabilizers. We classify such manifolds up to equivariant symplectomorphisms.

A topological condition is given, characterizing which closed manifolds in dimensions < 8 (and conjecturally in general) admit symplectic structures. The condition is the existence of a certain fibration-like structure called a hyperpencil.…

When solving combinatorial problems, pruning symmetric solution candidates from the search space is essential. Most of the existing approaches are instance-specific and focus on the automatic computation of Symmetry Breaking Constraints…

This paper deals with the problem of circle packing, in which the largest radii circle is to be fit in a confined space filled with arbitrary circles of different radii and centers. A circle packing problem is one of a variety of cutting…

We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…

We study in this paper the rational homotopy type of the space of symplectic embeddings of the standard ball $B^4(c) \subset \R^4$ into 4-dimensional rational symplectic manifolds. We compute the rational homotopy groups of that space when…

Given a simplicial complex with weights on its simplices, and a nontrivial cycle on it, we are interested in finding the cycle with minimal weight which is homologous to the given one. Assuming that the homology is defined with integer…

We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings…

By using totally isotropic subspaces in an orthogonal space Omega^{+}(2i,2), several infinite families of packings of 2^k-dimensional subspaces of real 2^i-dimensional space are constructed, some of which are shown to be optimal packings. A…

Let $X$ be any rational ruled symplectic four-manifold. Given a symplectic embedding $\iota:B_{c}\into X$ of the standard ball of capacity $c$ into $X$, consider the corresponding symplectic blow-up $\tX_{\iota}$. In this paper, we study…

We give examples of compact symplectic manifolds with disconnected contact type boundary in dimension $4n$ for any $n\geq 1$. The example is given by a subset of the tangent bundle of a compact quotient of the complex hyperbolic space…

The symplectomorphism group of a 2-dimensional surface is homotopy equivalent to the orbit of a filling system of curves. We give a generalization of this statement to dimension 4. The filling system of curves is replaced by a decomposition…

Cycle packing is a fundamental problem in optimization, graph theory, and algorithms. Motivated by recent advancements in finding vertex-disjoint paths between a specified set of vertices that either minimize the total length of the paths…

Solving high-dimensional optimal control problems in real-time is an important but challenging problem, with applications to multi-agent path planning problems, which have drawn increased attention given the growing popularity of drones in…

This paper determines the optimal upper bound for the simultaneous packing and covering constants of the two-dimensional centrally symmetric convex domains. It solved a problem opening for more than thirty years.

Given a graph, the general problem to cover the maximum number of vertices by a collection of vertex-disjoint long paths seemingly escapes from the literature. A path containing at least $k$ vertices is considered long. When $k \le 3$, the…

One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…