A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via Chinese remaindering, and then use Farey sequences for rational reconstruction. Successively enlarging the set of primes if needed, this method is guaranteed to work if we restrict ourselves to \u201cgood\u201d primes. Depending on the particular application, however, there may be no efficient way of identifying good primes.<\/p>\n
In the algebraic and geometric applications we have in mind, the final result consists of an a priori unknown ideal (or module) which is found via a construction yielding the (reduced) Gr\u00f6bner basis of the ideal. In this context, we discuss a general setup for modular and, thus, potentially parallel algorithms which can handle \u201cbad\u201d primes. A new key ingredient is an error tolerant algorithm for rational reconstruction via Gaussian reduction.<\/p>","DOI":"10.1090\/mcom\/2951","type":"journal-article","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T14:59:28Z","timestamp":1429109968000},"page":"3013-3027","source":"Crossref","is-referenced-by-count":22,"title":["The use of bad primes in rational reconstruction"],"prefix":"10.1090","volume":"84","author":[{"given":"Janko","family":"B\u00f6hm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfram","family":"Decker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claus","family":"Fieker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Pfister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","published-online":{"date-parts":[[2015,4,15]]},"reference":[{"key":"1","series-title":"Graduate Studies in Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/003","volume-title":"An introduction to Gr\\\"{o}bner bases","volume":"3","author":"Adams, William W.","year":"1994","ISBN":"https:\/\/id.crossref.org\/isbn\/0821838040"},{"issue":"4","key":"2","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0747-7171(02)00140-2","article-title":"Modular algorithms for computing Gr\u00f6bner bases","volume":"35","author":"Arnold, Elizabeth A.","year":"2003","journal-title":"J. Symbolic Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0747-7171","issn-type":"print"},{"key":"3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.jsc.2012.07.002","article-title":"Parallel algorithms for normalization","volume":"51","author":"B\u00f6hm, Janko","year":"2013","journal-title":"J. Symbolic Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0747-7171","issn-type":"print"},{"key":"4","unstructured":"J. B\u00f6hm, W. Decker, S. Laplagne, and G. Pfister, Local to global algorithms for the Gorenstein adjoint ideal of a curve. In preparation."},{"issue":"3","key":"5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1006\/jsco.1995.1051","article-title":"Efficient rational number reconstruction","volume":"20","author":"Collins, George E.","year":"1995","journal-title":"J. Symbolic Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0747-7171","issn-type":"print"},{"issue":"3","key":"6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/jsco.1995.1052","article-title":"Computing GCDs of polynomials over algebraic number fields","volume":"20","author":"Encarnaci\u00f3n, Mark J.","year":"1995","journal-title":"J. Symbolic Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0747-7171","issn-type":"print"},{"issue":"9","key":"7","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/j.jsc.2010.04.002","article-title":"Normalization of rings","volume":"45","author":"Greuel, Gert-Martin","year":"2010","journal-title":"J. Symbolic Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0747-7171","issn-type":"print"},{"issue":"6","key":"8","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/j.jsc.2011.01.003","article-title":"Parallelization of modular algorithms","volume":"46","author":"Idrees, Nazeran","year":"2011","journal-title":"J. Symbolic Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0747-7171","issn-type":"print"},{"issue":"4","key":"9","doi-asserted-by":"publisher","first-page":"Art. 46, 48","DOI":"10.1145\/1597036.1597050","article-title":"Low-dimensional lattice basis reduction revisited","volume":"5","author":"Nguyen, Phong Q.","year":"2009","journal-title":"ACM Trans. Algorithms","ISSN":"https:\/\/id.crossref.org\/issn\/1549-6325","issn-type":"print"},{"issue":"1","key":"10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01937322","article-title":"Mapping integers and Hensel codes onto Farey fractions","volume":"23","author":"Kornerup, Peter","year":"1983","journal-title":"BIT","ISSN":"https:\/\/id.crossref.org\/issn\/0006-3835","issn-type":"print"},{"key":"11","doi-asserted-by":"crossref","unstructured":"P. S. Wang, A p\u2013adic algorithm for univariate partial fractions. Proceedings SYMSAC \u201981, 212\u2013217 (1981).","DOI":"10.1145\/800206.806398"},{"key":"12","doi-asserted-by":"crossref","unstructured":"P. S. Wang, M. J. T. Guy, and J. H. Davenport, P\u2013adic reconstruction of rational numbers. SIGSAM Bull, 2\u20133 (1982).","DOI":"10.1145\/1089292.1089293"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2015-84-296\/S0025-5718-2015-02951-2\/S0025-5718-2015-02951-2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2015-84-296\/S0025-5718-2015-02951-2\/S0025-5718-2015-02951-2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T18:33:34Z","timestamp":1776796414000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2015-84-296\/S0025-5718-2015-02951-2\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,15]]},"references-count":12,"journal-issue":{"issue":"296","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["S0025-5718-2015-02951-2"],"URL":"https:\/\/doi.org\/10.1090\/mcom\/2951","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2015,4,15]]}}}