arXiv Analytics

Sign in

arXiv:1712.02329 [cs.SC]AbstractReferencesReviewsResources

Rings: an efficient Java/Scala library for polynomial rings

Stanislav Poslavsky

Published 2017-12-06Version 1

In this paper we briefly discuss Rings --- an efficient lightweight library for univariate and multivariate polynomial arithmetic over arbitrary coefficient rings. Basic algebra, GCDs and factorization of polynomials are implemented with the use of modern asymptotically fast algorithms. Rings provides a clean API for algebra and a fully typed hierarchy of mathematical structures. Scala API additionally brings powerful strongly typed functional programming model which allows to write short and expressive code for applications. Performance achieved in Rings is similar to such well known specialized solutions like Singular and considerably better than in some general-purpose systems like Mathematica. Rings is available from

Related articles:
arXiv:1711.11471 [cs.SC] (Published 2017-11-26)
Algorithms for the solution of systems of linear equations in commutative ring
arXiv:1705.05571 [cs.SC] (Published 2017-05-16)
A Tropical F5 algorithm
arXiv:0906.2315 [cs.SC] (Published 2009-06-12, updated 2009-06-14)
Symbolic Script Programming for Java