Implementing 2-descent for Jacobians of hyperelliptic curves
Implementing the Round Four maximal order algorithm
Implications of Spivey's Bell number formula.
Impossible Specifications for the Modular Group.
Improper Eisenstein Series on Bruhat-Tits Trees.
Improved bounds on the number of low-degree points on certain curves
Improved bounds on the number of ways of expressing as a binomial coefficient.
Improved discrepancy bounds for hybrid sequences involving Halton sequences
Improved upper bounds for the number of points on curves over finite fields
We give new arguments that improve the known upper bounds on the maximal number of rational points of a curve of genus over a finite field , for a number of pairs . Given a pair and an integer , we determine the possible zeta functions of genus- curves over with points, and then deduce properties of the curves from their zeta functions. In many cases we can show that a genus- curve over with points must have a low-degree map to another curve over , and often this is enough to...
Improved upper bounds for the star discrepancy of digital nets in dimension 3
Improvement on Davenport's iterative method and new results in additive number theory III
Improvement on Davenport's iterative method and new results in additive number theory, I
Improvement on Davenport's iterative method and new results in additive number theory II. Proof that G(5)≤22
Improvements of the discrepancy of the van der Corput sequence.
Improvements on the Cantor-Zassenhaus factorization algorithm
The paper presents a careful analysis of the Cantor-Zassenhaus polynomial factorization algorithm, thus obtaining tight bounds on the performances, and proposing useful improvements. In particular, a new simplified version of this algorithm is described, which entails a lower computational cost. The key point is to use linear test polynomials, which not only reduce the computational burden, but can also provide good estimates and deterministic bounds of the number of operations needed for factoring....
Improvements on the star discrepancy of (t,s)-sequences
Improvements to the Newman-Znám result for disjoint covering systems
Improving on the Brun-Titchmarsh theorem
In Gaussian integers has only trivial solutions – a new approach.
In praise of an elementary identity of Euler.