• Home
  • Search
  • Unique Factorization Domains in the Java Computer Algebra System
  • Cite Icon8
  • https://doi.org/10.1007/978-3-642-21046-4_5Copy DOI Icon

Unique Factorization Domains in the Java Computer Algebra System

  • Jan 1, 2011
  • Heinz Kredel
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper describes the implementation of recursive algorithms in unique factorization domains, namely multivariate polynomial greatest common divisors (gcd) and factorization into irreducible parts in the Java computer algebra library (JAS). The implementation of gcds, resultants and factorization is part of the essential building blocks for any computation in algebraic geometry, in particular in automated deduction in geometry. There are various implementations of these algorithms in procedural programming languages. Our aim is an implementation in a modern object oriented programming language with generic data types, as it is provided by Java programming language. We exemplify that the type design and implementation of JAS is suitable for the implementation of several greatest common divisor algorithms and factorization of multivariate polynomials. Due to the design we can employ this package in very general settings not commonly seen in other computer algebra systems. As for example, in the coefficient arithmetic for advanced Grobner basis computations like in polynomial rings over rational function fields or (finite, commutative) regular rings. The new package provides factory methods for the selection of one of the several implementations for non experts. Further we introduce a parallel proxy for gcd implementations which runs different implementations concurrently.

Similar Papers
  • Conference Article

Sufficient and necessary conditions of a module to be the unique factorization modules

  • Jan 01, 2022
  • AIP conference proceedings
  • I Putu Yudi Prabhadika +1
  • Conference Article
  • Citations75

The EZ GCD algorithm

  • Jan 01, 1973
  • Joel Moses +1
  • PDF
  • Research Article
  • Citations3

Shortest division chains in unique factorization domains

  • Feb 05, 2016
  • Journal of Symbolic Computation
  • Maksim Vaskouski +1
  • Research Article
  • Citations5

Reversible circuit design for GCD computation in cryptography algorithms

  • Dec 01, 2016
  • International Journal of Circuit Theory and Applications
  • H V Jayashree +2
  • Book Chapter
  • Citations7

Hankel matrices and polynomials

  • Jan 01, 1989
  • Juan Llovet +1
  • Conference Article
  • Citations10

Modular Inverse for Integers using Fast Constant Time GCD Algorithm and its Applications

  • Aug 01, 2021
  • Sanjay Deshpande +5
  • Research Article
  • Citations1

Blowing up finitely supported complete ideals in a regular local ring

  • Jun 01, 2016
  • Journal of Algebra
  • William Heinzer +2
  • Research Article
  • Citations16

Numerical implementation of the S-matrix algorithm for modeling of relief diffraction gratings

  • Nov 01, 2013
  • Journal of Modern Optics
  • Iryna Yaremchuk +5
  • Book Chapter
  • Citations11

On Generalized Lengths of Factorizations in Dedekind and Krull Domains

  • Jan 01, 2000
  • Scott T Chapman +2
  • Research Article
  • Citations8

The ring of holomorphic functions on a Stein compact set as a unique factorization domain

  • Jan 01, 1974
  • Proceedings of the American Mathematical Society
  • H G Dales
  • Research Article
  • Citations2

Arithmetic functions and the Cauchy product

  • Oct 03, 2019
  • Archiv der Mathematik
  • Yoshinori Hamahata
  • Research Article
  • Citations6

Unique factorization in polynomial rings with zero divisors

  • Jul 04, 2020
  • Journal of Algebra and Its Applications
  • D D Anderson +1
  • Research Article
  • Citations37

The divisor class groups of some rings of holomorphic functions

  • Jan 01, 1971
  • Mathematische Zeitschrift
  • David Prill
  • Book Chapter
  • Citations4

Divisor Graphs of a Commutative Ring

  • Jan 01, 2019
  • John D Lagrange
  • Research Article
  • Citations53

Blind image deconvolution using a robust GCD approach

  • Jan 01, 1999
  • IEEE Transactions on Image Processing
  • S Unnikrishna Pillai +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.