Related papers: Maximal Symplectic packings of $\P^2$

Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…

Let $B^{2n}(R)$ denote the closed $2n$-dimensional symplectic ball of area $R$, and let $\Sigma_g(L)$ be a closed symplectic surface of genus $g$ and area $L$. We prove that there is a symplectic embedding $\bigsqcup_{i=1}^k B^4(R_i) \times…

In this paper we study congruent and non-congruent hyperball (hypersphere) packings of the truncated regular tetrahedron tilings. These are derived from the Coxeter simplex tilings $\{p,3,3\}$ $(7\le p \in \mathbb{N})$ and $\{5,3,3,3,3\}$…

We prove two related concentration inequalities concerning the number of rational points of hyperelliptic curves over subsets of a finite field. In particular, we investigate the probability of a large discrepancy between the numbers of…

Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines. A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest…

We prove in this paper that any 4-dimensional symplectic manifold is essentially made of finitely many symplectic ellipsoids. The key tool is a singular analogue of Donaldson's symplectic hypersurfaces in irrational symplectic manifolds.

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…

In this article we explore a symplectic packing problem where the targets and domains are $2n$-dimensional symplectic manifolds. We work in the context where the manifolds have first homology group equal to $\mathbb{Z}^n$, and we require…

The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…

Consider the system of $n$ identical hard balls in $\mathbb R^3$ moving freely and colliding elastically. We show that there exist initial conditions such that the number of collisions is exponential in $n$.

We establish sharp bounds on the mixing rates of a class of two dimensional non-uniformly hyperbolic symplectic maps. This provides a primer on how to investigate such questions in a concrete example and, at the same time, it solves a…

We provide a complete classification of possible configurations of mutually pairwise touching infinite cylinders in Euclidian 3D space. It turns out that there is a maximum number of such cylinders possible in 3D independently on the shape…

Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…

We investigate plane curves intersecting in at most two unibranched points to study the algebraic exceptional set appearing in standard conjectures of diophantine and hyperbolic geometry. Our first result compares the local geometry of two…

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…

Huemer et al. (Discrete Mathematics, 2019) proved that for any two point sets $R$ and $B$ with $|R|=|B|$, the perfect matching that matches points of $R$ with points of $B$, and maximizes the total \emph{squared} Euclidean distance of the…

We study symplectic deformation types of minimal symplectic fillings of links of quotient surface singularities. In particular, there are only finitely many symplectic deformation types for each quotient surface singularity.

We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…

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.

In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…