Related papers: Point-curve incidences in the complex plane
Given a set of planar curves (Jordan arcs), each pair of which meets -- either crosses or touches -- exactly once, we establish an upper bound on the number of touchings. We show that such a curve family has $O(t^2n)$ touchings, where $t$…
In this paper we provide the non-existence criterion for the so-called maximizing curves of odd degrees. Furthermore, in the light of our criterion, we define a new class of plane curves that generalizes the notion of maximizing curves…
In their thought-provoking paper [1], Belkin et al. illustrate and discuss the shape of risk curves in the context of modern high-complexity learners. Given a fixed training sample size $n$, such curves show the risk of a learner as a…
Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…
In order to study projections of smooth curves, we introduce multifiltrations obtained by combining flags of osculating spaces. We classify all configurations of singularities occurring for a projection of a smooth curve embedded by a…
We prove two related concentration inequalities concerning the number of rational points of hyperelliptic curves over subsets of a finite field. In particular, we investigate the probability of a large discrepancy between the numbers of…
This paper proves that the facet-ridge incidence graph of the order complex of any finite geometric lattice of rank $r$ has diameter at most ${r \choose 2}$. A key ingredient is the well-known fact that every ordering of the atoms of any…
We generalize Siegel's theorem on integral points on affine curves to integral points of bounded degree, giving a complete characterization of affine curves with infinitely many integral points of degree d or less over some number field.…
We revisit Hopcroft's problem and related fundamental problems about geometric range searching. Given $n$ points and $n$ lines in the plane, we show how to count the number of point-line incidence pairs or the number of point-above-line…
Let $(\Sigma_n)$ be a sequence of surfaces immersed in a $4$-manifold $M$ which converges to a branched surface $\Sigma_0$ .\\ We denote by $k^T_p$ (resp. $k^N_p$) the amount of curvature of the tangent bundles $T\Sigma_n$ (resp. normal…
For a set $P$ of $n$ points in $\mathbb R^d$, for any $d\ge 2$, a hyperplane $h$ is called $k$-rich with respect to $P$ if it contains at least $k$ points of $P$. Answering and generalizing a question asked by Peyman Afshani, we show that…
A long standing conjecture of Richter and Thomassen states that the total number of intersection points between any $n$ simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same…
We show that Mirzakhani's curve counting theorem also holds if we replace surfaces by orbifolds.
The \emph{canonical degree} of a curve $C$ on a surface $X$ is $K_X\cdot C$. Our main result, is that on a surface of general type there are only finitely many curves with negative self--intersection and sufficiently large canonical degree.…
We establish improved finite field Szemeredi-Trotter and Beck type theorems. First we show that if P and L are a set of points and lines respectively in the plane F_p^2, with |P|,|L| \leq N and N<p, then there are at most C_1…
We consider 0-dimensional schemes supported at a single point in n-space that are m-symmetric, i.e. that intersect any smooth curve passing through the point with length m, and the ones among them that are maximal with respect to inclusion…
We describe a method to show a plane quartic over a number field has no rational points. The method can be adapted to show that a curve does not have divisors of degree 1 or 2 and can be generalized to arbitrary smooth projective curves.…
In this paper we prove that, for any $n\ge 3$, there exist infinitely many $r\in \N$ and for each of them a smooth, connected curve $C_r$ in $\P^r$ such that $C_r$ lies on exactly $n$ irreducible components of the Hilbert scheme…
We prove two theorems concerning incidence posets of graphs, cover graphs of posets and a related graph parameter. First, answering a question of Haxell, we show that the chromatic number of a graph is not bounded in terms of the dimension…
In the paper, we investigate properties of the nine-dimensional variety of the inflection points of the plane cubic curves. The description of local monodromy groups of the set of inflection points near singular cubic curves is given. Also,…