Related papers: Enumeration of points, lines, planes, etc

In this article we extend the notion of determinantal representation of hypersurfaces to the determinantal representation of sections of the determinant line bundle of a vector bundle. We give several examples, and prove some necessary…

Kelly's theorem states that a set of $n$ points affinely spanning $\mathbb{C}^3$ must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least…

A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…

Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let $X\subset \mathbb{R}^n$ Borel and $k \in [0, n-1]$ be an integer. Let $\dim (X \setminus H) = \dim X$ for every…

One of the De Bruijn - Erdos theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a single hyperedge equals the whole vertex set, the number of…

A well-known combinatorial theorem says that a set of n non-collinear points in the plane determines at least n distinct lines. Chen and Chv\'atal conjectured that this theorem extends to metric spaces, with an appropriated definition of…

We study plane algebraic curves defined over a field k of arbitrary characteristic as coverings of the the projective line and the problem of enumerating branched coverings of $\mathbb{P}^{1}$ by using combinatorial methods.

The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…

In this article we completely determine the possible dimensions of integral points and holomorphic curves on the complement of a union of hyperplanes in projective space. Our main theorems generalize a result of Evertse and Gyory, who…

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

We show that any set of $n$ points in general position in the plane determines $n^{1-o(1)}$ pairwise crossing segments. The best previously known lower bound, $\Omega\left(\sqrt n\right)$, was proved more than 25 years ago by Aronov, Erd\H…

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…

Let $X$ be an arbitrary smooth hypersurface in $\mathbb{C} \mathbb{P}^n$ of degree $d$. We prove the de Jong-Debarre Conjecture for $n \geq 2d-4$: the space of lines in $X$ has dimension $2n-d-3$. We also prove an analogous result for…

While equivariant methods have seen many fruitful applications in geometric combinatorics, their inability to answer the now settled Topological Tverberg Conjecture has made apparent the need to move beyond the use of Borsuk--Ulam type…

A hyperplane arrangement is said to satisfy the ``Riemann hypothesis'' if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which…

We study enumerative questions on the moduli space $\mathcal{M}(L)$ of hyperplane arrangements with a given intersection lattice $L$. Mn\"ev's universality theorem suggests that these moduli spaces can be arbitrarily complicated; indeed it…

A recent paper showed how to find sets of finite affine or projective planes constructed on a common set of points, so that lines of one plane meet lines of a different plane in at most two points. In this paper, those results are…

A set $L$ of straight lines and a set $P$ of points in the Euclidean plane define an arrangement $\mathcal{A}$ = ($L$, $P$) of construction lines and registration marks, if and only if: (1) any point in $P$ is a point of intersection of at…