\textsc{Rings}: an efficient Java/Scala library for polynomial rings

DOI10.1016/J.CPC.2018.09.005arXiv1712.02329OpenAlexW2771557154MaRDI QIDQ6159541FDOQ6159541

Authors: Stanislav Poslavsky 

Publication date: 5 May 2023

Published in: Computer Physics Communications (Search for Journal in Brave)

Abstract: In this paper we briefly discuss Rings --- an efficient lightweight library for commutative algebra. Polynomial arithmetic, GCDs, polynomial factorization and Gr"obner bases are implemented with the use of modern asymptotically fast algorithms. Rings can be easily interacted or embedded in applications in high-energy physics and other research areas via a simple API with fully typed hierarchy of algebraic structures and algorithms for commutative algebra. The use of the Scala language brings a quite novel powerful, strongly typed functional programming model allowing to write short, expressive, and fast code for applications. At the same time Rings shows one of the best performances among existing software for algebraic calculations. Rings is available from http://github.com/PoslavskySV/rings

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

zbMATH Keywords

computer algebracommutative algebrapolynomial arithmetic

Mathematics Subject Classification ID

Packaged methods for numerical algorithms (65Y15) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Software, source code, etc. for problems pertaining to quantum theory (81-04) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

Cites Work

• Introduction to the GiNaC framework for symbolic computation within the \(\text{C}^{++}\) programming language
• A novel approach to integration by parts reduction
• Absolute irreducibility of polynomials via Newton polytopes
• Factoring polynomials with rational coefficients
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Probabilistic algorithm for testing primality
• Modular algorithms for computing Gröbner bases.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• FORM version 4.0
• Title not available (Why is that?)
• A monte carlo method for factorization
• Title not available (Why is that?)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Title not available (Why is that?)
• \$\texttt{Apart}: a generalized \textsc{Mathematica} \texttt{Apart} function
• Title not available (Why is that?)
• The computation of polynomial greatest common divisors over an algebraic number field
• Computing GCDs of polynomials over algebraic number fields
• Title not available (Why is that?)
• On an installation of Buchberger's algorithm
• A new polynomial factorization algorithm and its implementation
• Hilbert functions and the Buchberger algorithm
• Title not available (Why is that?)
• Factoring polynomials and the knapsack problem
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• The EEZ-GCD algorithm
• Prime sieves using binary quadratic forms
• \textsc{MultivariateResidues} : a Mathematica package for computing multivariate residues
• Sparse polynomial multiplication and division in Maple 14

Cited In (2)

• Rings: an efficient JVM library for commutative algebra (invited talk)
• Accelerating parameter synthesis using semi-algebraic constraints

This page was built for publication: \textsc{Rings}: an efficient Java/Scala library for polynomial rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159541)