English
Related papers

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

200 papers

Given a point set $S=\{s_1,\ldots , s_n\}$ in the unit square $U=[0,1]^2$, an anchored square packing is a set of $n$ interior-disjoint empty squares in $U$ such that $s_i$ is a corner of the $i$th square. The reach $R(S)$ of $S$ is the set…

Computational Geometry · Computer Science 2018-06-26 Hugo A. Akitaya , Matthew D. Jones , David Stalfa , Csaba D. Tóth

We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.

Combinatorics · Mathematics 2008-05-19 Nicolas Bartholdi , Jérémy Blanc , Sébastien Loisel

In this paper we prove the connectedness of symplectic ball packings in the complement of a spherical Lagrangian, S^2 or RP^2, in symplectic manifolds that are rational or ruled. Via a symplectic cutting construction this is a natural…

Symplectic Geometry · Mathematics 2014-02-20 Matthew Strom Borman , Tian-Jun Li , Weiwei Wu

In this note we make several observations concerning symplectic cobordisms. Among other things we show that every contact 3-manifold has infinitely many concave symplectic fillings and that all overtwisted contact 3-manifolds are…

Symplectic Geometry · Mathematics 2007-05-23 John B. Etnyre , Ko Honda

We say that a subset of $\mathbb{P}^n(\mathbb{R})$ is maximally singular if its contains points with $\mathbb{Q}$-linearly independent homogenous coordinates whose uniform exponent of simultaneous rational approximation is equal to $1$, the…

Number Theory · Mathematics 2020-09-28 Anthony Poëls

We prove that, given any covering of any separable infinite-dimensional uniformly rotund and uniformly smooth Banach space $X$ by closed balls each of positive radius, some point exists in $X$ which belongs to infinitely many balls.

Functional Analysis · Mathematics 2012-12-13 Vladimir P. Fonf , Michael Levin , Clemente Zanco

A contact graph of a packing of closed balls is a graph with balls as vertices and pairs of tangent balls as edges. We prove that the average degree of the contact graph of a packing of balls (with possibly different radii) in…

Metric Geometry · Mathematics 2021-07-21 Alexey Glazyrin

Consider a set $X\subseteq \mathbb{R}^d$ which is 1-dense, namely, it intersects every unit ball. We show that we can get from any point to any other point in $\mathbb{R}^d$ in $n$ steps so that the intermediate points are in $X$, and the…

Combinatorics · Mathematics 2023-11-03 Endre Csóka

We provide a framework for which one can approach showing the integer decomposition property for symmetric polytopes. We utilize this framework to prove a special case which we refer to as $2$-partition maximal polytopes in the case where…

Combinatorics · Mathematics 2025-01-09 Su Ji Hong , George D. Nasr

In this note we consider two simplicial arrangements of lines and ideals $I$ of intersection points of these lines. There are $127$ intersection points in both cases and the numbers $t_i$ of points lying on exactly $i$ configuration lines…

Algebraic Geometry · Mathematics 2018-12-12 Marek Janasz , Magdalena Lampa-Baczyńska , Grzegorz Malara

For a graph whose vertices are points in $\mathbb R^d$, consider the closed balls with diameters induced by its edges. The graph is called a Tverberg graph if these closed balls intersect. A max-sum tree of a finite point set $X \subset…

Combinatorics · Mathematics 2023-11-23 Polina Barabanshchikova , Alexandr Polyanskii

In $n$-dimensional hyperbolic space $\mathbf{H}^n$ $(n\ge2)$ there are $3$-types of spheres (balls): the sphere, horosphere and hypersphere. If $n=2,3$ we know an universal upper bound of the ball packing densities, where each ball volume…

Metric Geometry · Mathematics 2016-12-15 Emil Molnár , Jenő Szirmai

A set $S$ of vertices in a graph is an open packing if (open) neighborhoods of any two distinct vertices in $S$ are disjoint. In this paper, we consider the graphs that have a unique maximum open packing. We characterize the trees with this…

Combinatorics · Mathematics 2019-01-29 Boštjan Brešar , Kirsti Kuenzel , Douglas F. Rall

Sphere packing problems have a rich history in both mathematics and physics; yet, relatively few analytical analyses of sphere packings exist, and answers to seemingly simple questions are unknown. Here, we present an analytical method for…

Soft Condensed Matter · Physics 2013-10-17 Natalie Arkus , Vinothan N. Manoharan , Michael P. Brenner

Dense, disordered packings of particles are useful models of low-temperature amorphous phases of matter, biological systems, granular media, and colloidal systems. The study of dense packings of nonspherical particles enables one to…

Soft Condensed Matter · Physics 2022-05-09 Charles Emmett Maher , Frank H. Stillinger , Salvatore Torquato

In hyperbolic space density cannot be defined by a limit as we define it in Euclidean space. We describe the local density bounds for sphere packings and we discuss the different attempts to define optimal arrangements in hyperbolic space.

Metric Geometry · Mathematics 2022-02-23 Gábor Fejes Tóth , Lázló Fejes Tóth , Włodzimierz. Kuperberg

Let the circle act symplectically on a compact, connected symplectic manifold $M$. If there are exactly three fixed points, $M$ is equivariantly symplectomorphic to $\mathbb{CP}^2$.

Symplectic Geometry · Mathematics 2019-02-20 Donghoon Jang

We give a classification of finite groups of symplectic birational automorphisms on a manifold of K3^[3]-type with stable and stably saturated cohomological action. We describe the group of polarized automorphisms of a smooth double…

Algebraic Geometry · Mathematics 2024-12-30 Simone Billi , Stevell Muller , Tomasz Wawak

Dense random packings of hard particles are useful models of granular media and are closely related to the structure of nonequilibrium low-temperature amorphous phases of matter. Most work has been done for random jammed packings of…

Statistical Mechanics · Physics 2015-05-14 Y. Jiao , F. H. Stillinger , S. Torquato

We revisit a version of the classic occupancy scheme, where balls are thrown until almost all boxes receive a given number of balls. Special cases are widely known as coupon-collectors and dixie cup problems. We show that as the number of…

Probability · Mathematics 2025-06-26 Alexander Gnedin , Svante Janson , Yaakov Malinovsky
‹ Prev 1 3 4 5 6 7 10 Next ›