English
Related papers

Related papers: On sets defining few ordinary lines

200 papers

For a finite set $P$ of points in the plane in general position, a \emph{crossing family} of size $k$ in $P$ is a collection of $k$ line segments with endpoints in $P$ that are pairwise crossing. It is a long-standing open problem to…

Combinatorics · Mathematics 2025-08-26 Todor Antić , Martin Balko , Birgit Vogtenhuber

Let $S$ be a set of $r$ red points and $b=r+2d$ blue points in general position in the plane, with $d\geq 0$. A line $\ell$ determined by them is said to be balanced if in each open half-plane bounded by $\ell$ the difference between the…

Combinatorics · Mathematics 2020-07-21 David Orden , Pedro Ramos , Gelasio Salazar

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

Combinatorics · Mathematics 2025-09-30 Marién Abreu , Martin Funk , Vedran Krčadinac , Domenico Labbate

We study several enumeration problems connected to linear trees, a broad class which includes stars, paths, generalized stars, and caterpillars. We provide generating functions for counting the number of linear trees on $n$ vertices,…

Combinatorics · Mathematics 2020-03-23 Tanay Wakhare , Eric Wityk , Charles R. Johnson

We consider straight line drawings of a planar graph $G$ with possible edge crossings. The \emph{untangling problem} is to eliminate all edge crossings by moving as few vertices as possible to new positions. Let $fix(G)$ denote the maximum…

Computational Geometry · Computer Science 2011-11-14 Alexander Ravsky , Oleg Verbitsky

A well-known theorem in plane geometry states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite metric spaces,…

Combinatorics · Mathematics 2021-07-15 Ida Kantor

A drawing of a graph is $k$-plane if every edge contains at most $k$ crossings. A $k$-plane drawing is saturated if we cannot add any edge so that the drawing remains $k$-plane. It is well-known that saturated $0$-plane drawings, that is,…

Combinatorics · Mathematics 2023-08-30 János Barát , Géza Tóth

Two sets $A$ and $B$ of points in the plane are \emph{mutually avoiding} if no line generated by any two points in $A$ intersects the convex hull of $B$, and vice versa. In 1994, Aronov, Erd\H os, Goddard, Kleitman, Klugerman, Pach, and…

Combinatorics · Mathematics 2020-06-23 Mozhgan Mirzaei , Andrew Suk

We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…

Algebraic Geometry · Mathematics 2019-10-09 Takuro Abe , Alexandru Dimca

A double-normal pair of a finite set $S$ of points from Euclidean space is a pair of points $\{p,q\}$ from $S$ such that $S$ lies in the closed strip bounded by the hyperplanes through $p$ and $q$ that are perpendicular to $pq$. A…

Combinatorics · Mathematics 2015-09-07 János Pach , Konrad J. Swanepoel

The B\"or\"oczky configuration of lines and (multiple) points exhibits extremal behavior in commutative algebra and combinatorics. Examples of this appear in the context of the containment problem for ordinary and symbolic powers and the…

Commutative Algebra · Mathematics 2025-10-21 Jake Kettinger , Shahriyar Roshan-Zamir

Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…

Metric Geometry · Mathematics 2016-07-20 János Pach , Frank de Zeeuw

Given a line arrangement $\cal A$ with $n$ lines, we show that there exists a path of length $n^2/3 - O(n)$ in the dual graph of $\cal A$ formed by its faces. This bound is tight up to lower order terms. For the bicolored version, we…

Combinatorics · Mathematics 2015-06-12 Udo Hoffmann , Linda Kleist , Tillmann Miltzow

Necessary and sufficient conditions for a measure to be an extreme point of the set of measures (on an abstract measurable space) with prescribed generalized moments are given, as well as an application to extremal problems over such moment…

Optimization and Control · Mathematics 2017-01-17 Iosif Pinelis

Let S be a set of 2n+1 points in the plane such that no three are collinear and no four are concyclic. A circle will be called point-splitting if it has 3 points of S on its circumference, n-1 points in its interior and n-1 in its exterior.…

Combinatorics · Mathematics 2007-05-23 Federico Ardila M

Let $P$ be a set of $n$ points in the plane, each point moving along a given trajectory. A {\em $k$-collinearity} is a pair $(L,t)$ of a line $L$ and a time $t$ such that $L$ contains at least $k$ points at time $t$, the points along $L$ do…

Computational Geometry · Computer Science 2011-05-17 Ben D. Lund , George B. Purdy , Justin W. Smith , Csaba D. Tóth

Let $S$ be a finite set of points in the plane and let $\mathcal{T}(S)$ be the set of intersection points between pairs of lines passing through any two points in $S$. We characterize all configurations of points $S$ such that iteration of…

Metric Geometry · Mathematics 2007-05-23 Christopher J. Hillar , Darren L. Rhea

For a nontrivial measurable set on the real line, there are always exceptional points, where the lower and upper densities of the set are neither zero nor one. We quantify this statement, following work by V. Kolyada, and obtain the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Andras Szenes

The Sylvester-Gallai theorem says that for any finite set of non-collinear points in $\R^2$, there is some line passing through exactly two points of the set. Over the complex numbers, this theorem fails: there are finite configurations…

Combinatorics · Mathematics 2025-09-01 Alex Cohen

Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…

Numerical Analysis · Mathematics 2025-07-16 H. Hakopian , G. Vardanyan , N. Vardanyan