Bad Primes in Computational Algebraic Geometry

DOI10.1007/978-3-319-42432-3_12zbMath1437.14059arXiv1702.06920OpenAlexW2488784915MaRDI QIDQ2819203

Claus Fieker, Janko Böhm, Gerhard Pfister, Santiago Laplagne, Wolfram Decker

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

algebraic curvesadjoint idealmodular computations

Mathematics Subject Classification ID

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

Related Items

Computing tropical varieties over fields with valuation, Complete integration-by-parts reductions of the non-planar hexagon-box via module intersections, Ideals Modulo a Prime

Uses Software

• SINGULAR
• Julia

Cites Work

• Unnamed Item
• Normalization of rings
• Mapping integers and Hensel codes onto Farey fractions
• An algebraic approach to computing adjoint curves
• Modular algorithms for computing Gröbner bases.
• An algorithm for computing an integral basis in an algebraic function field
• Parallel algorithms for normalization
• Local to Global Algorithms for the Gorenstein Adjoint Ideal of a Curve
• The use of bad primes in rational reconstruction