Related papers: Sub-Linear Point Counting for Variable Separated C…

Using the link between mod $p$ Galois representations of $\qu$ and mod $p$ modular forms established by Serre's Conjecture, we compute, for every prime $p\leq 1999$, a lower bound for the number of isomorphism classes of continuous Galois…

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

Suppose $F:=(f_1,\ldots,f_n)$ is a system of random $n$-variate polynomials with $f_i$ having degree $\leq\!d_i$ and the coefficient of $x^{a_1}_1\cdots x^{a_n}_n$ in $f_i$ being an independent complex Gaussian of mean $0$ and variance…

As another application of the degeneration methods of [V3], we count the number of irreducible degree $d$ geometric genus $g$ plane curves, with fixed multiple points on a conic $E$, not containing $E$, through an appropriate number of…

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

Let $K$ be the fraction field of a complete discrete valuation ring, with algebraically closed residue field of characteristic $p > 0$. This paper studies the index of a smooth, proper $K$-variety $X$ with logarithmic good reduction. We…

We introduce a new approach to isolate the real roots of a square-free polynomial $F=\sum_{i=0}^n A_i x^i$ with real coefficients. It is assumed that each coefficient of $F$ can be approximated to any specified error bound. The presented…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

We present a family of algorithms for computing the Galois group of a polynomial defined over a $p$-adic field. Apart from the "naive" algorithm, these are the first general algorithms for this task. As an application, we compute the Galois…

We produce a new family of polynomials f(x) over fields K of characteristic 2 which are exceptional, in the sense that f(x)-f(y) has no absolutely irreducible factors in K[x,y] besides the scalar multiples of x-y; when K is finite, this…

Let $p$ be a prime number and let $k$ be a number field. Let $E$ be an elliptic curve defined over $k$. We prove that if $p$ is odd, then the local-global divisibility by any power of $p$ holds for the torsion points of $E$. We also show…

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…

To a given real polynomial function f $\in$ R[x1, . . . , x d ], we associate real topological zeta functions Ztop,0(f\,; s) and Z $\pm$ top,0 (f\,; s) $\in$ Q(s), analogous to the topological zeta function of Denef and Loeser in the…

Counts of curves in $\mathbb{P}^1\times\mathbb{P}^1$ with fixed contact order with the toric boundary and satisfying point conditions can be determined with tropical methods by Mikhalkin. If we require that our curves intersect the zero-…

For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…

Currently, the best upper bounds on the number of rational points on an absolutely irreducible, smooth, projective algebraic curve of genus g defined over a finite field F_q come either from Serre's refinement of the Weil bound if the genus…

Let $F$ be an algebraically closed field of characteristic $p>0$. In this paper we develop methods to represent arbitrary elements of $F[t]$ as sums of perfect $k$-th powers for any $k\in\mathbb{N}$ relatively prime to $p$. Using these…

An efficient integer factorization algorithm would reduce the security of all variants of the RSA cryptographic scheme to zero. Despite the passage of years, no method for efficiently factoring large semiprime numbers in a classical…

We prove that the number of curves of a fixed genus g over finite fields is a polynomial function of the size of the field if and only if g is at most 8. Furthermore, we determine for each positive genus g the smallest n such that the…

For small odd primes $p$, we prove that most of the rational points on the modular curve $X_0(p)/w_p$ parametrize pairs of elliptic curves having infinitely many supersingular primes. This result extends the class of elliptic curves for…