Related papers: Curves in $\mathbb{R}^4$ and two-rich points
In their solution to the orchard-planting problem, Green and Tao established a structure theorem which proves that in a line arrangement in the real projective plane with few double points, most lines are tangent to the dual curve of a…
Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given…
Let $X$ be an irreducible projective variety of dimension $n$ in a projective space and let $x$ be a point of $X$. Denote by ${\rm Curves}_d(X,x)$ the space of curves of degree $d$ lying on $X$ and passing through $x$. We will show that the…
Let $X$ be a very general degree $d\geq 5$ hypersurface in $\mathbb{P}^3$. We compute the ample cone of the Hilbert scheme $X^{[n]}$ of $n$ points on $X$ for various small values of $n$ (the answer is already known for large $n$). We obtain…
In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…
We bound the maximal number N of singular points of a plane algebraic curve C that has precisely one place at infinity with one branch in terms of its first Betti number $b_1(C)$. Asymptotically we prove that $N<\sim{17/11}b_1(C)$ for large…
In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…
We consider a minimizing variant of the well-known \emph{No-Three-In-Line Problem}, the \emph{Geometric Dominating Set Problem}: What is the smallest number of points in an $n\times n$~grid such that every grid point lies on a common line…
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 the first known nontrivial bounds on the sizes of the 2-torsion subgroups of the class groups of cubic and higher degree number fields $K$ (the trivial bound being $O_{\epsilon}(|{\rm Disc}(K)|^{1/2+\epsilon})$ by Brauer--Siegel).…
A plane curve $C\subset\mathbb{P}^2$ of degree $d$ is called \emph{blocking} if every $\mathbb{F}_q$-line in the plane meets $C$ at some $\mathbb{F}_q$-point. We prove that the proportion of blocking curves among those of degree $d$ is…
Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…
A classical theorem of Siegel asserts that the set of S-integral points of an algebraic curve C over a number field is finite unless C has genus 0 and at most two points at infinity. In this paper we give necessary and sufficient conditions…
In this note we study the distribution of real inflection points among the ovals of a real non-singular hyperbolic curve of even degree. Using Hilbert's method we show that for any integers $d$ and $r$ such that $4\leq r \leq 2d^2-2d$,…
We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on…
We obtain an upper bound for the volume of the convex hull of a simple closed Frenet curve with exactly four vertices, i.e., four points of vanishing torsion, and lying on the boundary of its convex hull. Moreover, we show that the upper…
The problem of constructing curves with many points over finite fields has received considerable attention in the recent years. Using the class field theory approach, we construct new examples of curves ameliorating some of the known…
The location-domination number is conjectured to be at most half of the order for twin-free graphs with no isolated vertices. We prove that this conjecture holds and is tight for subcubic graphs. We also show that the same upper bound holds…
For prime powers q<100, we compute new upper and lower bounds on N_q(4), the maximal number of points on a genus-4 curve over a finite field with q elements. We determine the exact value of N_q(4) for 17 prime powers q for which the value…
In this paper, we contribute toward a classification of two-variable polynomials by classifying (up to an automorphism of $C^2$) polynomials whose Newton polygon is either a triangle or a line segment. Our classification has several…