Rings: an efficient Java/Scala library for polynomial rings

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 a...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Author: Poslavsky, Stanislav
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 21.09.2018
Subjects:
Algebra
Algorithms
Functional programming
Java
Polynomials
Rings (mathematics)
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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
Bibliography:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.1712.02329