An implementation of the number field sieve.
An improved estimate concerning 3n+1 predecessor sets
An investigation of bounds for the regulator of quadratic fields.
Another relation between π, e, γ and ζ(n).
Approximate polynomial GCD
The computation of polynomial greatest common divisor (GCD) ranks among basic algebraic problems with many applications, for example, in image processing and control theory. The problem of the GCD computing of two exact polynomials is well defined and can be solved symbolically, for example, by the oldest and commonly used Euclid’s algorithm. However, this is an ill-posed problem, particularly when some unknown noise is applied to the polynomial coefficients. Hence, new methods for the GCD computation...
Approximatting rings of integers in number fields
In this paper we study the algorithmic problem of finding the ring of integers of a given algebraic number field. In practice, this problem is often considered to be well-solved, but theoretical results indicate that it is intractable for number fields that are defined by equations with very large coefficients. Such fields occur in the number field sieve algorithm for factoring integers. Applying a variant of a standard algorithm for finding rings of integers, one finds a subring of the number field...
Arithmetic diophantine approximation for continued fractions-like maps on the interval
We establish arithmetical properties and provide essential bounds for bi-sequences of approximation coefficients associated with the natural extension of maps, leading to continued fraction-like expansions. These maps are realized as the fractional part of Möbius transformations which carry the end points of the unit interval to zero and infinity, extending the classical regular and backwards continued fraction expansions.
Around Apéry's constant.
Artin's conjecture, Turing's method, and the Riemann hypothesis.
Aspectos computacionales de los números primos (I).
Bases of canonical number systems in quartic algebraic number fields
Canonical number systems can be viewed as natural generalizations of radix representations of ordinary integers to algebraic integers. A slightly modified version of an algorithm of B. Kovács and A. Pethő is presented here for the determination of canonical number systems in orders of algebraic number fields. Using this algorithm canonical number systems of some quartic fields are computed.
Berechnung der Menge von Primzahlen, welche innerhalb der ersten Milliarde natürlicher Zahlen vorkommen
Berkowitz's algorithm and clow sequences.
Beta expansion of Salem numbers approaching Pisot numbers with the finiteness property
It is already known that all Pisot numbers are beta numbers, but for Salem numbers this was proved just for the degree 4 case. In 1945, R. Salem showed that for any Pisot number θ we can construct a sequence of Salem numbers which converge to θ. In this short note, we give some results on the beta expansion for infinitely many sequences of Salem numbers obtained by this construction.
Bicyclotomic polynomials and impossible intersections
In a recent paper we proved that there are at most finitely many complex numbers such that the points and are both torsion on the Legendre elliptic curve defined by . In a sequel we gave a generalization to any two points with coordinates algebraic over the field and even over . Here we reconsider the special case and with complex numbers and .
Binary BBP-formulae for logarithms and generalized Gaussian-Mersenne primes.
Block systems of a Galois group.
Bounding the Coefficients of a Divisor of a Given Polynomial.
Bounds and computational results for exponential sums related to cusp forms
The aim of this paper is to present some computer data suggesting the correct size of bounds for exponential sums of Fourier coefficients of holomorphic cusp forms.
Bounds for discriminants and related estimates for class numbers, regulators and zeros of zeta functions : a survey of recent results
A bibliography of recent papers on lower bounds for discriminants of number fields and related topics is presented. Some of the main methods, results, and open problems are discussed.