English
Related papers

Related papers: Planar point sets with forbidden $4$-point pattern…

200 papers

Suppose we are given a set $\mathcal{D}$ of $n$ pairwise intersecting disks in the plane. A planar point set $P$ stabs $\mathcal{D}$ if and only if each disk in $\mathcal{D}$ contains at least one point from $P$. We present a deterministic…

Computational Geometry · Computer Science 2021-04-29 Sariel Har-Peled , Haim Kaplan , Wolfgang Mulzer , Liam Roditty , Paul Seiferth , Micha Sharir , Max Willert

Let $P$ be a set of $n$ points in $\mathbb{R}^d$, in general position. We remove all of them one by one, in each step erasing one vertex of the convex hull of the current remaining set. Let $g_d(P)$ denote the number of different removal…

Combinatorics · Mathematics 2024-11-15 Dániel Gábor Simon

Let $d \geq 3$ be a natural number. We show that for all finite, non-empty sets $A \subseteq \mathbb{R}^d$ that are not contained in a translate of a hyperplane, we have \[ |A-A| \geq (2d-2)|A| - O_d(|A|^{1- \delta}),\] where $\delta >0$ is…

Combinatorics · Mathematics 2023-06-22 Akshat Mudgal

We give a quintet of proofs resulting from questions posed by Erd\H{o}s. These questions concern ordinary lines in planar point sets, sequences with uniformly small exponential sums, $K_4$-free $4$-critical graphs with few chords in any…

Combinatorics · Mathematics 2026-04-09 Boris Alexeev , Moe Putterman , Mehtaab Sawhney , Mark Sellke , Gregory Valiant

A family of $k$ point sets in $d$ dimensions is well-separated if the convex hulls of any two disjoint subfamilies can be separated by a hyperplane. Well-separation is a strong assumption that allows us to conclude that certain kinds of…

Computational Geometry · Computer Science 2022-09-07 Helena Bergold , Daniel Bertschinger , Nicolas Grelier , Wolfgang Mulzer , Patrick Schnider

In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…

Combinatorics · Mathematics 2024-08-16 Thang Pham , Boqing Xue

We study the minimum number of distinct distances between point sets on two curves in $R^3$. Assume that one curve contains $m$ points and the other $n$ points. Our main results: (a) When the curves are conic sections, we characterize all…

Combinatorics · Mathematics 2023-03-21 Toby Aldape , Jingyi Liu , Gregory Pylypovych , Adam Sheffer , Minh-Quan Vo

let f be an endomorphism of a complex projective space, of degree bigger than one. Let us call an algebraic subset exceptional for f, if its inverse image is set-theoretically equal to itself. J.-Y. Briend, S. Cantat and M. Shishikura…

Algebraic Geometry · Mathematics 2007-05-23 E. Amerik , F. Campana

Given a collection of points in the plane, classifying which subsets are collinear is a natural problem and is related to classical geometric constructions. We consider collections of points in a projective plane over a finite field such…

Algebraic Geometry · Mathematics 2023-11-29 Andrei Staicu

Suppose that $nk$ points in general position in the plane are colored red and blue, with at least $n$ points of each color. We show that then there exist $n$ pairwise disjoint convex sets, each of them containing $k$ of the points, and each…

Combinatorics · Mathematics 2017-06-08 Andreas F. Holmsen , Jan Kynčl , Claudiu Valculescu

In this paper, we investigate the problem of separating a set $X$ of points in $\mathbb{R}^{2}$ with an arrangement of $K$ lines such that each cell contains an asymptotically equal number of points (up to a constant ratio). We consider a…

Combinatorics · Mathematics 2017-01-18 Nikhil Marda

Congruence between two n-point sets in 4 dimension can be checked in O(n log n) time. On the way to establishing this result, we revisit several parts of 4-dimensional geometry, such as angles and distances between planes, Hopf fibrations,…

Computational Geometry · Computer Science 2016-03-24 Heuna Kim , Günter Rote

We study a family of variants of Erd\H os' unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, we look for…

Combinatorics · Mathematics 2020-12-01 Slade Gunter , Eyvi Palsson , Ben Rhodes , Steven Senger

A matchstick graph is a plane graph with edges drawn as unit distance line segments. This class of graphs was introduced by Harborth who conjectured that a matchstick graph on $n$ vertices can have at most $\lfloor 3n - \sqrt{12n -…

Combinatorics · Mathematics 2025-06-04 Panna Gehér , Géza Tóth

We show that the number of incidences between $m$ distinct points and $n$ distinct lines in ${\mathbb R}^4$ is $O\left(2^{c\sqrt{\log m}} (m^{2/5}n^{4/5}+m) + m^{1/2}n^{1/2}q^{1/4} + m^{2/3}n^{1/3}s^{1/3} + n\right)$, for a suitable…

Combinatorics · Mathematics 2015-03-26 Micha Sharir , Noam Solomon

A smooth ruled surface in 4-space has only parabolic points or inflection points of real type. We show, by means of contact with transverse planes, that at a parabolic point, there exist two tangent directions determining two planes along…

Differential Geometry · Mathematics 2024-04-16 Jorge Luiz Deolindo-Silva

We prove that if $E \subset {\Bbb F}_q^d$, $d \ge 2$, $F \subset \operatorname{Graff}(d-1,d)$, the set of affine $d-1$-dimensional planes in ${\Bbb F}_q^d$, then $|\Delta(E,F)| \ge \frac{q}{2}$ if $|E||F|>q^{d+1}$, where $\Delta(E,F)$ the…

Combinatorics · Mathematics 2017-11-15 P. Birklbauer , A. Iosevich , T. Pham

We consider a question raised by Rudnev: given four pencils of $n$ concurrent lines in $\mathbb R^2$, with the four centres of the pencils non-collinear, what is the maximum possible size of the set of points where four lines meet? Our main…

Combinatorics · Mathematics 2018-05-24 Oliver Roche-Newton , Audie Warren

We prove that for all positive integers $n$ and $k$, there exists an integer $N = N(n,k)$ satisfying the following. If $U$ is a set of $k$ direction vectors in the plane and $\mathcal{J}_U$ is the set of all line segments in direction $u$…

Combinatorics · Mathematics 2021-01-11 Jinha Kim , Minki Kim , O-Joung Kwon

Suppose $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$ is a set of $n$ points in the plane with diameter $\leq 1$, meaning $|x_i - x_j| \leq 1$ for all $1 \leq i,j \leq n$. We show that the ratio of the number of ``neighbors''…

Combinatorics · Mathematics 2026-05-19 Samuel Korsky
‹ Prev 1 8 9 10 Next ›