arXiv Open Access 2018

Resolving zero-divisors using Hensel lifting

John Kluesner Michael Monagan

Lihat Sumber

Abstrak

Algorithms which compute modulo triangular sets must respect the presence of zero-divisors. We present Hensel lifting as a tool for dealing with them. We give an application: a modular algorithm for computing GCDs of univariate polynomials with coefficients modulo a radical triangular set over the rationals. Our modular algorithm naturally generalizes previous work from algebraic number theory. We have implemented our algorithm using Maple's RECDEN package. We compare our implementation with the procedure RegularGcd in the RegularChains package.

Topik & Kata Kunci

cs.SC

Penulis (2)

John Kluesner

Michael Monagan

Format Sitasi

APA MLA BibTeX

Kluesner, J., Monagan, M. (2018). Resolving zero-divisors using Hensel lifting. https://arxiv.org/abs/1801.03161

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2018
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓