Related papers: On Equal Point Separation by Planar Cell Decomposi…

Polynomial partitioning techniques have recently led to improved geometric data structures for a variety of fundamental problems related to semialgebraic range searching and intersection searching in 3D and higher dimensions (e.g., see…

Consider degenerations of Abelian differentials with prescribed number and multiplicity of zeros and poles. Motivated by the theory of limit linear series, we define twisted canonical divisors on pointed nodal curves to study degenerate…

We give some sufficient conditions of separation of two sets of integer points by a hyperplane. Our conditions are related to the notion of convexity of sets of integer points and are weaker than existing notions.

We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…

We show that for any large $n$, there exists a set of $n$ points in the plane with $O(n^2/\sqrt{\log n})$ distinct distances, such that any four points in the set determine at least five distinct distances. This answers (in the negative) a…

We generalize the joints problem to sets of varieties and prove almost sharp bound on the number of joints. As a special case, given a set of $N$ $2$-planes in $\mathbb{R}^6$, the number of points at which three $2$-planes intersect and…

We study the orchard problem on cubic surfaces. We classify possibly reducible cubic surfaces $X\subseteq \mathbb{P}^3(\C)$ with smooth components on which there exist families of finite sets (of unbounded size) with quadratically many…

Given sets $\mathcal{P}, \mathcal{Q} \subseteq \mathbb{R}^2$ of sizes $m$ and $n$ respectively, we are interested in the number of distinct distances spanned by $\mathcal{P} \times \mathcal{Q}$. Let $D(m, n)$ denote the minimum number of…

The Bounded Negativity Conjecture predicts that for any smooth complex surface $X$ there exists a lower bound for the selfintersection of reduced divisors on $X$. This conjecture is open. It is also not known if the existence of such a…

We prove algebraic analogues of the facts that a curve on a surface with self-intersection number zero is homotopic to a cover of a simple curve, and that two simple curves on a surface with intersection number zero can be isotoped to be…

Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…

This paper extends Bombieri and Pila's estimate of lattice points on curves to arbitrary finite sets by incorporating considerations of minimal separation and the doubling constant. We derive the estimate by establishing the $\ell^2$…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$, and let $\rho_E\colon {\rm Gal}(\overline{\mathbb{Q}}/\mathbb{Q})\to {\rm GL}(2,\widehat{ \mathbb{Z} })$ be the adelic representation associated to the natural action of Galois on the…

In this paper, we show that the $C^1$-differentiability of the norm of a two-dimensional normed space depends only on distances between points of the unit sphere in two different ways. As a consequence, we see that any isometry between the…

We consider the following question: Given $n$ lines and $n$ circles in $\mathbb{R}^3$, what is the maximum number of intersection points lying on at least one line and on at least one circle of these families. We prove that if there are no…

A separating ($M-2$)-curve is a smooth geometrically irreducible real projective curve $X$ such that $X(\mathbb{R})$ has $g-1$ connected components and $X(\mathbb{C})\setminus X(\mathbb{R})$ is disconnected. Let $T_g$ be a Teichm\"uller…

We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a…

We prove a geometric version of the graph separator theorem for the unit disk intersection graph: for any set of $n$ unit disks in the plane there exists a line $\ell$ such that $\ell$ intersects at most $O(\sqrt{(m+n)\log{n}})$ disks and…

The "separation dimension" of a graph $G$ is the minimum positive integer $d$ for which there is an embedding of $G$ into $\mathbb{R}^d$, such that every pair of disjoint edges are separated by some axis-parallel hyperplane. We prove a…

In 1997, Erd\H{o}s asked whether for arbitrarily large $n$ there exists a set of $n$ points in $\mathbb{R}^2$ that determines $O(\frac{n}{\sqrt{\log n}})$ distinct distances while satisfying the local constraint that every 4-point subset…