OSCAR : Antic Workshop and coding sprint

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.

When?

July 31st - August 4th immediately after ISSAC 2017

Where?

TU Kaiserslautern, Germany

Registration

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

Topics

• \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

Talks

• Tommy Hoffmann : Fundamental algorithms in Hecke
• Bill Hart : Fundamental algorithms in Nemo
• Fredrik Johansson : TBA
• Luca de Feo : \bar{Fp} in Nemo (possible approaches)
• Jean Kiefer : Isogeny based cryptography in Nemo

Organisers

• 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)