Related papers: Algebraic Methods in Discrete Analogs of the Kakey…

We describe a method to show that certain elliptic surfaces do not admit purely inseparable multisections (equivalently, that genus one curves over function fields admit no points over the perfect closure of the base field) and use it to…

Green's Conjecture predicts than one can read off special linear series on an algebraic curve, by looking at the syzygies of its canonical embedding. We extend Voisin's results on syzygies of K3 sections, to the case of K3 surfaces with…

We consider intersections of n diagonal forms of degrees k 1 < $\bullet$ $\bullet$ $\bullet$ < kn, and we prove an asymptotic formula for the number of rational points of bounded height on these varieties. The proof uses the…

In this note we give a counterexample to a conjecture proposed by Ciliberto about special linear systems of P^n through multiple base points.

A Kakeya set $\mathcal{K}$ in an affine plane of order $q$ is the point set covered by a set $\mathcal{L}$ of $q+1$ pairwise non-parallel lines. Large Kakeya sets were studied by Dover and Mellinger; in [6] they showed that Kakeya sets with…

The Tijdeman-Zagier conjecture states no integer solution exists for $A^X+B^Y=C^Z$ with positive integer bases and integer exponents greater than 2 unless gcd$(A,B,C)>1$. Any set of values that satisfy the conjecture correspond to a lattice…

For any n>3, we provide examples of curves lying on K3 surfaces and vector bundles on those curves which invalidate Mercat's conjecture for rank n bundles.

Given a surface S in P^3 and a collection of general points on it, how many surfaces of a given degree intersect S in a curve with prescribed multiplicities at the points? We formulate two natural conjectures which would answer this…

In Surveys in Differential Geometry, Volume 7, published in 2002 and Philosophical Transactions of the Royal Society A, Volume 359, published in 2001, Sir Michael Atiyah introduced what is known as the Atiyah problem on configurations of…

Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean d-space that guarantees any such point set admits a…

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

We present some elementary ideas to prove the following Sylvester-Gallai type theorems involving incidences between points and lines in the planes over the complex numbers and quaternions. (1) Let A and B be finite sets of at least two…

A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in general metric spaces, where the line…

The restriction and Kakeya problems in Euclidean space have received much attention in the last few decades, and are related to many problems in harmonic analysis, PDE, and number theory. In this paper we initiate the study of these…

In this paper, we present an alternative proof of a finiteness theorem due to Bombieri, Masser and Zannier concerning intersections of a curve in the multiplicative group of dimension n with algebraic subgroups of dimension n-2. The proof…

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of $n$ points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$ outside of the segment delimited by $x$…

Given a finite field k of characteristic at least 5, we show that the Tate conjecture holds for K3 surfaces defined over the algebraic closure of k if and only if there are only finitely many K3 surfaces over each finite extension of k.

In the paper ``Lower bounds on the number of crossing-free subgraphs of $K_N$'' (Computational Geometry 16 (2000), 211-221), it is shown that a double chain of $n$ points in the plane admits at least $\Omega(4.642126305^n)$ polygonizations,…

We give a construction of an infinite set of points $A$ in $\mathbb{R}^2$ such that any subset $P\subseteq A$ has a constant density subset $P'$ with no three points collinear and yet $A$ cannot be separated into finitely many subsets such…

We prove that a minimal $t$-fold blocking set in a finite projective plane of order $n$ has cardinality at most \[\frac{1}{2} n\sqrt{4tn - (3t + 1)(t - 1)} + \frac{1}{2} (t - 1)n + t.\] This is the first general upper bound on the size of…