Related papers: Counting points on superelliptic curves in average…

Let $\mathbf{f} = \left(f_1, \dots, f_p\right) $ be a polynomial tuple in $\mathbb{Q}[z_1, \dots, z_n]$ and let $d = \max_{1 \leq i \leq p} \deg f_i$. We consider the problem of computing the set of asymptotic critical values of the…

We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…

We present families of (hyper)elliptic curve which admit an efficient deterministic encoding function.

We give an account of the complex Arithmetic-Geometric Mean (AGM), as first studied by Gauss, together with details of its relationship with the theory of elliptic curves over $\C$, their period lattices and complex parametrisation. As an…

For $m,n \in \mathbb{N}$, $m\geq 1$ and a given function $f : \mathbb{R}^m\longrightarrow \mathbb{R}$ the polynomial interpolation problem (PIP) is to determine a \emph{generic node set} $P \subseteq \mathbb{R}^m$ and the coefficients of…

We define and study when a polynomial mapping has a local or global time average. We conjecture that a polynomial f in the complex plane has a time average near a point z if and only if z is eventually mapped into a Siegel-disc of f. We…

We present a computational approach to general hyperelliptic Riemann surfaces in Weierstrass normal form. The surface is either given by a list of the branch points, the coefficients of the defining polynomial or a system of cuts for the…

In general, algorithms for computing the Selmer group of the Jacobian of a curve have relied on either homogeneous spaces or functions on the curve. We present a theoretical analysis of algorithms which use functions on the curve, and show…

This paper studies the problem of enumerating all maximal collinear subsets of size at least three in a given set of $n$ points. An algorithm for this problem, besides solving degeneracy testing and the exact fitting problem, can also help…

If $E$ is an elliptic curve defined over $\mathbb Q$ and $p$ is a prime of good reduction for $E$, let $E(\mathbb F_p)$ denote the set of points on the reduced curve modulo $p$. Define an arithmetic function $M_E(N)$ by setting $M_E(N):=…

In the combinatorial method proving of $L^p$-improving estimates for averages along curves pioneered by Christ (IMRN, 1998), it is desirable to estimate the average modulus (with respect to some uniform measure on a set) of a…

In this paper, we consider the counting function $E_P(y) = |P_{y} \cap Z^{n_x}|$ for a parametric polyhedron $P_{y} = \{x \in R^{n_x} \colon A x \leq b + B y\}$, where $y \in R^{n_y}$. We give a new representation of $E_P(y)$, called a…

Let $E$ be an elliptic curve defined over $\Q$ and with complex multiplication by $\mO_K$, the ring of integers in an imaginary quadratic field $K$. It is known that $E(\F_p)$ has a structure E(\F_p)\simeq \Z/d_p\Z \oplus \Z/e_p\Z. with…

We present a randomized algorithm for estimating the $p$th moment $F_p$ of the frequency vector of a data stream in the general update (turnstile) model to within a multiplicative factor of $1 \pm \epsilon$, for $p > 2$, with high constant…

In recent algorithms that use deformation in order to compute the number of points on varieties over a finite field, certain differential equations of matrices over p-adic fields emerge. We present a novel strategy to solve this kind of…

We give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension. This is an improvement over existing algorithms which could only compute the periods of plane curves. Our algorithm reduces the evaluation of…

We introduce several new methods to obtain upper bounds on the number of solutions of the congruences $f(x) \equiv y \pmod p$ and $f(x) \equiv y^2 \pmod p,$ with a prime $p$ and a polynomial $f$, where $(x,y)$ belongs to an arbitrary square…

This paper presents in detail the originally developed Quadratic Point Estimate Method (QPEM), aimed at efficiently and accurately computing the first four output moments of probabilistic distributions, using 2n^2+1 sample (or sigma)…

In this paper we show how to explicitly write down equations of hyperelliptic curves over Q such that for all odd primes l the image of the mod l Galois representation is the general symplectic group. The proof relies on understanding the…

We establish upper and lower bounds for the number of integral points which lie within a neighbourhood of a smooth nondegenerate curve in $\mathbb{R}^n$ for $n\geq 3$. These estimates are new for $n\geq 4$, and we recover an earlier result…