Bad Primes in Computational Algebraic Geometry

DOI10.1007/978-3-319-42432-3_12MaRDI QIDQ2819203zbMATH OpenOpenAlexFDO

Authors Janko Böhm, W. Decker, Claus Fieker, Santiago Laplagne, Gerhard Pfister

Publication date 28 September 2016

Published in Mathematical Software – ICMS 2016 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1702.06920

zbMATH Keywords

adjoint idealalgebraic curvesmodular computations

Mathematics Subject Classification ID

Computational aspects of algebraic curves (14Q05) Symbolic computation and algebraic computation (68W30)

Abstract: Computations over the rational numbers often suffer from intermediate coefficient swell. One solution to this problem is to apply the given algorithm modulo a number of primes and then lift the modular results to the rationals. This method is guaranteed to work if we use a sufficiently large set of good primes. In many applications, however, there is no efficient way of excluding bad primes. In this note, we describe a technique for rational reconstruction which will nevertheless return the correct result, provided the number of good primes in the selected set of primes is large enough. We give a number of illustrating examples which are implemented using the computer algebra system Singular and the programming language Julia. We discuss applications of our technique in computational algebraic geometry.

Recommendations

• Polynomials with prescribed bad primes
• scientific article; zbMATH DE number 3119358
• Cyclotomic root systems and bad primes
• Computing all elliptic curves over an arbitrary number field with prescribed primes of bad reduction
• Congruence computations in principal arithmetical varieties
• The use of bad primes in rational reconstruction
• Prime numbers of bad reduction for dessins of genus 0
• scientific article; zbMATH DE number 125228
• A bound on the primes of bad reduction for CM curves of genus 3
• Computing Elliptic Curves over $$\mathbb{Q}$$ : Bad Reduction at One Prime

Cites work

• An algebraic approach to computing adjoint curves
• An algorithm for computing an integral basis in an algebraic function field
• scientific article; zbMATH DE number 3815844 (Why is no real title available?)
• Local to global algorithms for the Gorenstein adjoint ideal of a curve
• Mapping integers and Hensel codes onto Farey fractions
• Modular algorithms for computing Gröbner bases.
• Normalization of rings
• Parallel algorithms for normalization
• The use of bad primes in rational reconstruction

Cited in

(8)

• Complete integration-by-parts reductions of the non-planar hexagon-box via module intersections
• Computing tropical varieties over fields with valuation
• The variety of bad zero-schemes
• Ideals modulo a prime
• The use of bad primes in rational reconstruction
• An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
• msolve. A library for solving polynomial systems
• Some applications of Chinese remainder theorem codes with error-correction

Describes a project that uses

Uses Software

• Julia
• SINGULAR

This page was built for publication: Bad Primes in Computational Algebraic Geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819203)