English
Related papers

Related papers: Compatible 4-Holes in Point Sets

200 papers

A seminal theorem of Tverberg states that any set of $T(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Almost any collection of fewer points in…

Combinatorics · Mathematics 2023-11-10 Leah Leiner , Steven Simon

A conjecture is made that the weight space for 4D, $\cal N$-extended supersymmetrical representations is embedded within the permutahedra associated with permutation groups ${\mathbb{S}}{}_{d}$. Adinkras and Coxeter Groups associated with…

High Energy Physics - Theory · Physics 2021-05-21 Aleksander J. Cianciara , S. James Gates , Yangrui Hu , Renee Kirk

Given a finite point set $P$ in the plane, a subset $S \subseteq P$ is called an island in $P$ if $conv(S) \cap P = S$. We say that $S\subset P$ is a visible island if the points in $S$ are pairwise visible and $S$ is an island in $P$. The…

Combinatorics · Mathematics 2022-02-15 Sophie Leuchtner , Carlos M. Nicolas , Andrew Suk

Let $D(n)$ be the number of pairwise disjoint Steiner quadruple systems. A simple counting argument shows that $D(n) \leq n-3$ and a set of $n-3$ such systems is called a large set. No nontrivial large set was constructed yet, although it…

Combinatorics · Mathematics 2019-12-11 Tuvi Etzion , Junling Zhou

Let $P_1, P_2,\ldots, P_{d+1}$ be pairwise disjoint $n$-element point sets in general position in $d$-space. It is shown that there exist a point $O$ and suitable subsets $Q_i\subseteq P_i \; (i=1, 2, \ldots, d+1)$ such that $|Q_i|\geq…

Combinatorics · Mathematics 2016-09-06 János Pach

We show that the union of $n$ translates of a convex body in $\mathbb{R}^3$ can have $\Theta(n^3)$ holes in the worst case, where a hole in a set $X$ is a connected component of $\mathbb{R}^3 \setminus X$. This refutes a 20-year-old…

Computational Geometry · Computer Science 2019-06-11 Boris Aronov , Otfried Cheong , Michael Gene Dobbins , Xavier Goaoc

We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…

Computational Geometry · Computer Science 2014-05-12 Thomas Bläsius , Guido Brückner , Ignaz Rutter

Let $P$ be a set of $n$ points on the plane in general position. We say that a set $\Gamma$ of convex polygons with vertices in $P$ is a convex decomposition of $P$ if: Union of all elements in $\Gamma$ is the convex hull of $P,$ every…

Computational Geometry · Computer Science 2012-07-19 Mario Lomeli-Haro

We investigate spaces of symplectic embeddings of $n\leq 4$ balls into the complex projective plane. We prove that they are homotopy equivalent to explicitly described algebraic subspaces of the configuration spaces of $n$ points. We…

Symplectic Geometry · Mathematics 2024-02-09 Sílvia Anjos , Jarek Kędra , Martin Pinsonnault

We study the maximum size of a subset of the $n \times n$ integer grid that does not contain specific geometric configurations, a variation of the classical problems initiated by Erd\H{o}s and Purdy. While extremal problems for 3-point…

Combinatorics · Mathematics 2026-02-23 Máté Jánosik , Artúr Nádor , Zoltán Lóránt Nagy , László Bence Simon

The convex rope problem is to find a counterclockwise or clockwise convex rope starting at the vertex a and ending at the vertex b of a simple polygon P, where a is a vertex of the convex hull of P and b is visible from infinity. The convex…

Optimization and Control · Mathematics 2023-05-22 Le Hong Trang , Nguyen Thi Le , Phan Thanh An

It has been conjectured by P\'{o}lya and Szeg\"{o} seventy years ago that the planar set which minimizes the first eigenvalue of the Dirichlet-Laplace operator among polygons with $n$ sides and fixed area is the regular polygon. Despite its…

Optimization and Control · Mathematics 2022-03-31 Beniamin Bogosel , Dorin Bucur

Given a convex polygon $P$ with $k$ vertices and a polygonal domain $Q$ consisting of polygonal obstacles with total size $n$ in the plane, we study the optimization problem of finding a largest similar copy of $P$ that can be placed in $Q$…

Computational Geometry · Computer Science 2020-12-15 Taekang Eom , Seungjun Lee , Hee-Kap Ahn

A convex polygon $A$ is related to a convex $m$-gon $K= \bigcap_{i=1}^m k_i^+$, where $k_1^+,..., k_m^+$ are the $m$ halfplanes whose intersection is equal to $K$, if $A$ is the intersection of halfplanes $a_1^+,...,a_l$, each of which is a…

Metric Geometry · Mathematics 2012-01-05 Meir Katchalski , David Nashtir

For a positive integer $n\geq 3$, the sides and diagonals of a convex $n$-gon divide the interior of the convex $n$-gon into finitely (polynomial in $n$) many regions bounded by them. In this article, we associate to every region a unique…

Combinatorics · Mathematics 2021-04-13 C P Anil Kumar

A convex geometry is a closure system satisfying the anti-exchange property. In this work we document all convex geometries on 4- and 5-element base sets with respect to their representation by circles on the plane. All 34 non-isomorphic…

Every polygon with n vertices in the complex projective plane is naturally associated with its adjoint curve of degree n-3. Hence the adjoint of a heptagon is a plane quartic. We prove that a general plane quartic is the adjoint of exactly…

Algebraic Geometry · Mathematics 2024-08-29 Daniele Agostini , Daniel Plaumann , Rainer Sinn , Jannik Lennart Wesner

We prove that if $N$ points lie in convex position in the plane then they determine $\Omega(N^{5/4})$ distinct angles, provided that the points do not lie on a common circle. This is derived from a more general claim that if $N$ points in…

Combinatorics · Mathematics 2025-10-14 Sergei V. Konyagin , Jonathan Passant , Misha Rudnev

We use the $4-\epsilon$ expansion to search for fixed points corresponding to $2+1$ dimensional $\mathcal{N}$=1 Wess-Zumino models of $N_{\Phi}$ scalar superfields interacting through a cubic superpotential. In the $N_{\Phi}=3$ case, we…

High Energy Physics - Theory · Physics 2021-12-22 Pedro Liendo , Junchen Rong

We propose a geometric structure induced by any given convex polygon $P$, called $Nest(P)$, which is an arrangement of $\Theta(n^2)$ line segments, each of which is parallel to an edge of $P$, where $n$ denotes the number of edges of $P$.…

Computational Geometry · Computer Science 2019-07-12 Kai Jin