Related papers: Algorithmic Symplectic Packing
The Two-dimensional Bin Packing Problem calls for packing a set of rectangular items into a minimal set of larger rectangular bins. Items must be packed with their edges parallel to the borders of the bins, cannot be rotated and cannot…
In smooth and convex multiobjective optimization problems the set of Pareto optima is diffeomorphic to an $m-1$ dimensional simplex, where $m$ is the number of objective functions. The vertices of the simplex are the optima of the…
We present a technique novel in numerical methods. It compiles the domain of the numerical methods as a discretized volume. Congruent elements are glued together to compile the domain over which the solution of a boundary value problem of a…
We study the rigidity and flexibility of symplectic embeddings of simple shapes. It is first proved that under the condition $r_n^2 \le 2 r_1^2$ the symplectic ellipsoid $E(r_1, ..., r_n)$ with radii $r_1 \le ... \le r_n$ does not embed in…
Using the topological technique of diagrams of spaces, we calculate the homology of the union and the complement of finite arrangements of subspaces of the form $D + SP^{n-d}(X)$ in symmetric products $SP^n(X)$ where $D\in SP^d(X)$. As an…
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programming bounds. We consider problems where the objective function…
We consider the problem of space-efficiently estimating the number of simplices in a hypergraph stream. This is the most natural hypergraph generalization of the highly-studied problem of estimating the number of triangles in a graph…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…
Supermanifolds provide a very natural ground to understand and handle supersymmetry from a geometric point of view; supersymmetry in $d=3,4,6$ and $10$ dimensions is also deeply related to the normed division algebras. In this paper we want…
Tusn\'ady's problem asks to bound the discrepancy of points and axis-parallel boxes in $\mathbb{R}^d$. Algorithmic bounds on Tusn\'ady's problem use a canonical decomposition of Matou\v{s}ek for the system of points and axis-parallel boxes,…
After investigating the $3$-dimensional case [35], we continue to address and close the problems of optimal ball and horoball packings in truncated Coxeter orthoschemes with parallel faces that exist in $n$-dimensional hyperbolic space…
We find a recursive algorithm for computing the precise centralizers of the complex orthogonal and symplectic groups, and hence the isotropy groups, with respect to the similarity transformation on the spaces of skew-symmetric and…
We consider optimization problems with manifold-valued constraints. These generalize classical equality and inequality constraints to a setting in which both the domain and the codomain of the constraint mapping are smooth manifolds. We…
Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For finite graphs one popular way to compute upper bounds for…
We consider maximum packings of edge-disjoint $4$-cliques in the complete graph $K_n$. When $n \equiv 1$ or $4 \pmod{12}$, these are simply block designs. In other congruence classes, there are necessarily uncovered edges; we examine the…
In this paper, we study a new type of clustering problem, called {\em Chromatic Clustering}, in high dimensional space. Chromatic clustering seeks to partition a set of colored points into groups (or clusters) so that no group contains…
We discuss various aspects of "braid spaces'' or configuration spaces of unordered points on manifolds. First we describe how the homology of these spaces is affected by puncturing the underlying manifold, hence extending some results of…
Symplectic N-body integrators are widely used to study problems in celestial mechanics. The most popular algorithms are of 2nd and 4th order, requiring 2 and 6 substeps per timestep, respectively. The number of substeps increases rapidly…
Homogeneous compatible almost complex structures on symplectic manifolds are studied, focusing on those which are special, meaning that their Chern-Ricci form is a multiple of the symplectic form. Non Chern-Ricci flat ones are proven to be…
We consider the homogenized linear feasibility problem, to find an $x$ on the unit sphere, satisfying $n$ line ar inequalities $a_i^Tx\ge 0$. To solve this problem we consider the centers of the insphere of spherical simpl ices, whose…