The use of bad primes in rational reconstruction

DOI10.1090/mcom/2951zbMath1326.13018arXiv1207.1651OpenAlexW1973618699MaRDI QIDQ5501158

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

Publication date: 13 August 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

Gröbner basesmodular arithmeticrational reconstructionFarey map

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Parallel algorithms in computer science (68W10) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)

Related Items

Computing integral bases via localization and Hensel lifting, Local to Global Algorithms for the Gorenstein Adjoint Ideal of a Curve, A smoothness test for higher codimensions, Modular techniques for noncommutative Gröbner bases, Modular computations of standard bases for subalgebras, Fault-tolerant modular reconstruction of rational numbers, Implicitization of hypersurfaces, Usage of modular techniques for efficient computation of ideal operations, Complete integration-by-parts reductions of the non-planar hexagon-box via module intersections, Towards massively parallel computations in algebraic geometry, Bad Primes in Computational Algebraic Geometry, Surfaces with canonical map of maximum degree

Cites Work

• Unnamed Item
• Unnamed Item
• Normalization of rings
• Mapping integers and Hensel codes onto Farey fractions
• Modular algorithms for computing Gröbner bases.
• Efficient rational number reconstruction
• Computing GCDs of polynomials over algebraic number fields
• Parallel algorithms for normalization
• Parallelization of modular algorithms
• Low-dimensional lattice basis reduction revisited
• P-adic reconstruction of rational numbers
• Local to Global Algorithms for the Gorenstein Adjoint Ideal of a Curve