Related papers: Counting points on curves over families in polynom…
We study the distribution of the number of rational points in a family of curves over a finite field of characteristic 2. This distribution determines the coset weight distribution of a certain BCH code.
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
We design nearly-linear time numerical algorithms for the problem of multivariate multipoint evaluation over the fields of rational, real and complex numbers. We consider both \emph{exact} and \emph{approximate} versions of the algorithm.…
Among all the dynamical modular curves associated to quadratic polynomial maps, we determine which curves have infinitely many quadratic points. This yields a classification statement on preperiodic points for quadratic polynomials over…
Mcduff had proposed in 1997 a way to modify the definition of Taubes' version of Gromov invariant when multiple coverings of -1 curves appear. In this paper we generalize Mcduff's proposal to the family case, as is needed in the discussion…
We determine in this paper the distribution of the number of points on the cyclic covers of $\mathbb{P}^1(\mathbb{F}_q)$ with affine models $C: Y^r = F(X)$, where $F(X) \in \mathbb{F}_q[X]$ and $r^{th}$-power free when $q$ is fixed and the…
We discuss a particular problem of enumerating rational curves on a Grassmannian from several perspectives, including systems theory, real enumerative geometry, and symbolic computation. We also present a new transversality result, showing…
Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…
In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…
Let n_\delta be the number of \delta-nodal curves lying in a suitably ample complete linear system |L| and passing through appropriately many points on a smooth projective complex algebraic surface. A major open problem is to understand the…
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…
We consider a quantum polynomial-time algorithm which solves the discrete logarithm problem for points on elliptic curves over $GF(2^m)$. We improve over earlier algorithms by constructing an efficient circuit for multiplying elements of…
We obtain a recursive formula for the number of rational degree $d$ curves in $\mathbb{CP}^2$ that pass through $3d+1-m$ generic points and that have an $m$-fold singular point. The special case of counting curves with a triple point was…
The purpose of this paper is to give an introduction to the field of Schema Theory written by a mathematician and for mathematicians. In particular, we endeavor to to highlight areas of the field which might be of interest to a…
We provide in this paper an upper bound for the number of rational points on a curve defined over a one variable function field over a finite field. The bound only depends on the curve and the field, but not on the Jacobian variety of the…
In this article, we consider a collection of geometric problems involving points colored by two colors (red and blue), referred to as bichromatic problems. The motivation behind studying these problems is two fold; (i) these problems appear…
Fewnomial theory began with explicit bounds -- solely in terms of the number of variables and monomial terms -- on the number of real roots of systems of polynomial equations. Here we take the next logical step of investigating the…
Let $\mathcal{F}$ be a plane singular curve defined over a finite field $\mathbb{F}_q$. The linear system of plane curves of a given degree passing through the singularities of $\cF$ provides potentially good bounds for the number of points…