English
Related papers

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

200 papers

This is a survey article on symplectically aspherical manifolds. The paper contains a discussion on constructions of symplectically aspherical manifolds, their topological properties and the role of this class in symplectic topology.…

Symplectic Geometry · Mathematics 2008-09-02 Jarek Kedra , Yuli Rudyak , Aleksy Tralle

Let R be a family of n axis-parallel rectangles with packing number p-1, meaning that among any p of the rectangles, there are two with a non-empty intersection. We show that the union complexity of R is at most O(n+p^2), and that the…

Combinatorics · Mathematics 2017-02-06 Chaya Keller , Shakhar Smorodinsky

We show that there is an hierarchy of intersection rigidity properties of sets in a closed symplectic manifold: some sets cannot be displaced by symplectomorphisms from more sets than the others. We also find new examples of rigidity of…

Symplectic Geometry · Mathematics 2014-01-14 Michael Entov , Leonid Polterovich

In this note, we obtain new obstructions to symplectic embeddings of a product of disks (a polydisk) into a 4-dimensional ball. The polydisk P(r,s) is the product of the disk of area r with the disk of area s. The ball of capacity a,…

Symplectic Geometry · Mathematics 2013-04-11 Richard Hind , Samuel Lisi

This second part on polygons in the hyperbolic plane is based on the first part which deals with uniqueness and existence of cocyclic polygons with prescribed sidelengths. The topic here is the maximum question for the area of these…

Metric Geometry · Mathematics 2010-08-24 Rolf Walter

Let $X$ be the blow up of $\mathbb{P}^2$ at $r$ general points $p_1,\ldots,p_r \in \mathbb{P}^2$. We study line bundles on $X$ given by plane curves of degree $d$ passing through $p_i$ with multiplicity $m_i$. We establish conditions for…

Algebraic Geometry · Mathematics 2016-10-20 Krishna Hanumanthu

We describe the entanglement of two indistinguishable delocalized spin-$\frac{1}{2}$ particles in the simplest spatial configuration of three spatial modes with the constraint that at most one particle occupy each mode. It is show that this…

Quantum Physics · Physics 2016-02-25 Markus Johansson

A family of spherical caps of the 2-dimensional unit sphere $\mathbb{S}^2$ is called a totally separable packing in short, a TS-packing if any two spherical caps can be separated by a great circle which is disjoint from the interior of each…

Metric Geometry · Mathematics 2025-05-07 Károly Bezdek , Zsolt Lángi

We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…

Metric Geometry · Mathematics 2011-10-20 Karoly Bezdek , Zsolt Langi , Marton Naszodi , Peter Papez

We use floor decompositions of tropical curves to prove that any enumerative problem concerning conics passing through projective-linear subspaces in $\RP^n$ is maximal. That is, there exist generic configurations of real linear spaces such…

Algebraic Geometry · Mathematics 2011-02-10 Erwan Brugallé , Nicolas Puignau

We prove the uniqueness, up to diffeomorphism, of symplectically aspherical fillings of the unit cotangent bundle of odd-dimensional spheres. As applications, we first show the non-existence of exact symplectic cobordisms between some…

Symplectic Geometry · Mathematics 2025-12-23 Myeonggi Kwon , Takahiro Oba

We discuss the geometry of the unit ball -- specifically, the structure of its extreme points (if any) -- in subspaces of $L^1$ and $L^\infty$ on the circle that are formed by functions with prescribed spectral gaps. A similar issue is…

Functional Analysis · Mathematics 2022-11-03 Konstantin M. Dyakonov

We show that the maximum cardinality of an anti-chain composed of intersections of a given set of n points in the plane with half-planes is close to quadratic in n. We approach this problem by establishing the equivalence with the problem…

Metric Geometry · Mathematics 2015-02-18 Rom Pinchasi , Günter Rote

Given an assignment of weights w to the edges of a graph G, a matching M in G is called strongly w-maximal if for any matching N the sum of weights of the edges in N\M is at most the sum of weights of the edges in M\N. We prove that if w…

Combinatorics · Mathematics 2009-11-23 Ron Aharoni , Eli Berger , Agelos Georgakopoulos , Philipp Sprüssel

We study the smallest intersecting and enclosing ball problems in Euclidean spaces for input objects that are compact and convex. They link and unify many problems in computational geometry and machine learning. We show that both problems…

Computational Geometry · Computer Science 2025-04-28 Jiaqi Zheng , Tiow-Seng Tan

We construct maximal $\Lambda(p)$-subsets on a large class of curved manifolds, in an optimal range of Lebesgue exponents $p$. Our arguments combine restriction estimates and decoupling with old and new probabilistic estimates.

Classical Analysis and ODEs · Mathematics 2024-11-08 Ciprian Demeter , Hongki Jung , Donggeun Ryou

We exploit a connection between distances in the infinite percolation cluster, when the parameter is close to one, and the discrete-time TASEP on $\mathbb{Z}$. This shows that when the parameter goes to one, large balls in the cluster are…

Probability · Mathematics 2013-05-02 Anne-Laure Basdevant , Nathanaël Enriquez , Lucas Gerin , Jean-Baptiste Gouéré

In this paper, we construct an infinite series of line arrangements in characteristic two, each featuring only triple intersection points. This finding challenges the existing conjecture that suggests the existence of only a finite number…

Combinatorics · Mathematics 2025-05-21 Lukas Kühne , Tomasz Szemberg , Halszka Tutaj-Gasińska

Motivated by a question of W. Kuperberg, we study the 18-dimensional manifold of configurations of 6 non-intersecting infinite cylinders of radius $r,$ all touching the unit ball in $\mathbb{R}^{3}.$ We find a configuration with \[…

Metric Geometry · Mathematics 2019-05-13 Oleg Ogievetsky , Senya Shlosman

Given an initial configuration of pebbles on a graph, one can move pebbles in pairs along edges, at the cost of one of the pebbles moved, with the objective of reaching a specified target vertex. The pebbling number of a graph is the…

Combinatorics · Mathematics 2009-09-29 Airat Bekmetjev , Glenn Hurlbert
‹ Prev 1 8 9 10 Next ›