Displaying 201 – 220 of 1964

Showing per page

A failure of quantifier elimination.

Angus Macintyre, David Marker (1997)

Revista Matemática de la Universidad Complutense de Madrid

We show that log is needed to eliminate quantifiers in the theory of the real numbers with restricted analytic functions and exponentiation.

A family of deformations of the Riemann xi-function

Masatoshi Suzuki (2013)

Acta Arithmetica

We introduce a family of deformations of the Riemann xi-function endowed with two continuous parameters. We show that it has rich analytic structure and that its conjectural (mild) zero-free region for some fixed parameter is a sufficient condition for the Riemann hypothesis to hold for the Riemann zeta function.

A fast algorithm for polynomial factorization over p

David Ford, Sebastian Pauli, Xavier-François Roblot (2002)

Journal de théorie des nombres de Bordeaux

We present an algorithm that returns a proper factor of a polynomial Φ ( x ) over the p -adic integers p (if Φ ( x ) is reducible over p ) or returns a power basis of the ring of integers of p [ x ] / Φ ( x ) p [ x ] (if Φ ( x ) is irreducible over p ). Our algorithm is based on the Round Four maximal order algorithm. Experimental results show that the new algorithm is considerably faster than the Round Four algorithm.

Currently displaying 201 – 220 of 1964