Related papers: Quantitative Curve Selection Lemma

Let $k$ be an algebraically closed field of characteristic zero. Let $S$ be a smooth projective variety over $k$ and let $p_S:X\rightarrow S$ be a family of smooth projective curves over $S$. Let $E$ be a vector bundle over $X$. For $s\in…

We develop an algorithm to test whether a non-CM elliptic curve $E/\mathbb{Q}$ gives rise to an isolated point of any degree on any modular curve of the form $X_1(N)$. This builds on prior work of Zywina which gives a method for computing…

We discuss an analogue of Riemann-Roch theorem for curves with an infinite number of handles. We represent such a curve X by its Shottki model, which is an open subset U of CP^{1} with infinite union of circles as a boundary. An appropriate…

Let $d$ and $k$ be positive integers. Let $\mu$ be a positive Borel measure on $\mathbb{R}^2$ possessing finite moments up to degree $2d-1$. If the support of $\mu$ is contained in an algebraic curve of degree $k$, then we show that there…

We show that, for a constant-degree algebraic curve $\gamma$ in $\mathbb{R}^D$, every set of $n$ points on $\gamma$ spans at least $\Omega(n^{4/3})$ distinct distances, unless $\gamma$ is an {\it algebraic helix} (see Definition 1.1). This…

The distribution of degree $d$ points on curves is well understood, especially for low degrees. We refine this study to include information on the Galois group in the simplest interesting case: $d = 3$. For curves of genus at least 5, we…

We study the following problem and its applications: given a homogeneous degree-$d$ polynomial $g$ as an arithmetic circuit, and a $d \times d$ matrix $X$ whose entries are homogeneous linear polynomials, compute $g(\partial/\partial x_1,…

Consider a system of n polynomial equations and r polynomial inequations in n indeterminates of degree bounded by d with coefficients in a polynomial ring of s parameters with rational coefficients of bit-size at most $\sigma$. From the…

The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…

There are two purposes in this article. One is to present a criterion for the existence of a birational embedding into a projective plane with inner and outer Galois points for algebraic curves. Another is to classify plane curves of degree…

Let $X$ be a smooth projective curve over a number field $k$. Let $f\colon X \to \mathbb{P}^1$ be a non-constant morphism that realizes the gonality of $X$. In this article we study the growth rate of $\left\{P\in X\left(\overline{k}…

We give a self-contained introduction to isolated points on curves and their counterpoint, parameterized points, that situates these concepts within the study of the arithmetic of curves. In particular, we show how natural geometric…

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

In this article we prove several new uniform upper bounds on the number of points of bounded height on varieties over $\mathbb{F}_q[t]$. For projective curves, we prove the analogue of Walsh' result with polynomial dependence on $q$ and the…

Finding paths in graphs is a fundamental graph-theoretic task. In this work, we we are concerned with finding a path with some constraints on its length and the number of vertices neighboring the path, that is, being outside of and incident…

For a variety of regularized optimization problems in machine learning, algorithms computing the entire solution path have been developed recently. Most of these methods are quadratic programs that are parameterized by a single parameter,…

Let V $\subset$ C n be an equidimensional algebraic set and g be an n-variate polynomial with rational coefficients. Computing the critical points of the map that evaluates g at the points of V is a cornerstone of several algorithms in real…

Let $k$ be a number field and $S$ a finite set of places of $k$ containing the archimedean ones. We count the number of algebraic points of bounded height whose coordinates lie in the ring of $S$-integers of $k$. Moreover, we give an…

Let $d,m_1,...,m_r$ be ($r+1$) positive integers, and $P_1,...,P_r$ be $r$ general points in the projective plane ; let $m$ be a positive integer. We prove that there exists a bound $d_0(m)$ such that : If $m_i < m$ ($0<i<r+1$), and $d >…

In this paper, we study degree conditions for three types of disjoint directed path cover problems: many-to-many $k$-DDPC, one-to-many $k$-DDPC and one-to-one $k$-DDPC, which are intimately connected to other famous topics in graph theory,…