Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language

Abstract

We introduce two new packages, Nemo and Hecke, written in the Julia programming language for computer algebra and number theory. We demonstrate that high performance generic algorithms can be implemented in Julia, without the need to resort to a low-level C implementation. For specialised algorithms, we use Julia's efficient native C interface to wrap existing C/C++ libraries such as Flint, Arb, Antic and Singular. We give examples of how to use Hecke and Nemo and discuss some algorithms that we have implemented to provide high performance basic arithmetic.

arXiv commentISSAC '17, Kaiserslautern, Germany, July 25-28, 2017, 8 pages

Cited by in corpus (12)

• Gaussian Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits
• $k$-point semidefinite programming bounds for equiangular lines
• Norm relations and computational problems in number fields
• On the p-adic Stark conjecture at s=1 and applications
• Solving clustered low-rank semidefinite programs arising from polynomial optimization
• Computing characteristic polynomials of hyperplane arrangements with symmetries
• Rational Function Simplification for Integration-by-Parts Reduction and Beyond
• Standard Lattices of Compatibly Embedded Finite Fields
• SIC-POVMs from Stark Units: Dimensions n^2+3=4p, p prime
• Towards the classification of symplectic linear quotient singularities admitting a symplectic resolution
• Determining unit groups and ${\mathrm{K}}_1$ of finite rings
• Modules over orders, conjugacy classes of integral matrices, and abelian varieties over finite fields