OSCAR : Antic Workshop and coding sprint

wbhart edited this page Aug 4, 2017 · 20 revisions

The OSCAR : Antic workshop aims to begin work on number theory in the new computer algebra system, OSCAR (Open Source Computer Algebra Resource), that we are developing.

Antic is the component of OSCAR that includes Hecke.jl, Nemo.jl and the Flint and Antic C libraries and their dependencies.


July 31st - August 4th immediately after ISSAC 2017

First talk is at 11am on Monday.


TU Kaiserslautern, Germany

Building 48, room 436.


Please send an email to goodwillhart@googlemail.com to register. Everyone is welcome to attend (max. capacity of 20)


  • \bar{Q} and embeddings of number fields in Antic
  • algorithms for sparse linear algebra
  • \bar{Fp} in Antic
  • real/complex root isolation

Depending on interest of participants, we may also cover:

  • Applications of multivariable polynomials
  • Elliptic curves over finite fields
  • Laurent and Puiseux series
  • Various coding sprints, as suggested by participants


All talks are in building 48, room 436

  • Bill Hart : Fundamental algorithms in Nemo -- Monday 11 am slides
  • Luca De Feo : \bar{Fp} in Nemo (possible approaches) -- Tuesday 10:30 slides
  • Fredrik Johansson : Fundamental algorithms in Arb -- Wednesday 10:30 slides
  • Jean Kieffer : Isogeny based cryptography in Nemo -- Thursday 10:30 slides


  • Claus Fieker (PI)
  • Tommy Hofmann
  • Bill Hart

Confirmed participants

  • Tommy Hofmann (Kaiserslautern)
  • Bill Hart (Kaiserslautern)
  • Daniel Schultz (Kaiserslautern)
  • Rémi Imbach (Kaiserslautern)
  • Fredrik Johansson (Bordeaux)
  • Luca De Feo (Université de Versailles)
  • Jean Kieffer (ENS Paris)
  • Sebastian Gutsche (Siegen)
  • Dima Pasechnik (Oxford)
  • Thomas Breuer (Aachen)
Clone this wiki locally
You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session.
Press h to open a hovercard with more details.