Computer Algebra refers to the study and design of algorithms for manipulating mathematical expressions and objects. It lies at the interface between mathematics, computer science and various application fields.
It covers a wide range of subjects, such as effective linear algebra, algorithmic number theory, integration and summation in closed form, differential and polynomial system solving, or special functions.

The French computer algebra community is internationally renowned for the
excellence of its theoretical work. Several libraries produced by its members are part of mainstream software packages such as Maple.

This success is notably due to the Journées nationales de calcul formel (JNCF), which are a remarkable opportunity for researchers to discuss recent and ongoing work with their peers. In 2017, we plan to extend these days for the first time to Mediterranean countries.

The main goals of the JNCF are to foster collaborations between researchers, and to provide guidance and training to young researchers.

Expected outcomes include:
• A better integration of young researchers. The JNCF are an ideal opportunity
for young researchers to present their results for the first time and also to get an overview of the various advances in Computer Algebra. This is especially important in the computer algebra community, where researchers need to build skills in both computer science and mathematics.

• New collaborations and interactions. The JNCF have traditionally been an opportunity to create successful collaborations between researchers from different parts of France. We now would like the JNCF to open to an international community, while remaining primarily French-speaking. The previous two editions already included courses by colleagues from other European countries, and we intend to continue this trend. Additionally, we plan to better advertise the next JNCF in Mediterranean countries.

To support these goals, the days are articulated around courses by internationally recognized researchers, and shorter talks given mostly by PhD students and young researchers.

 Scientific Committee

Magali Bardet (Université de Rouen)
Paola Boito (Université de Limoges)
Delphine Boucher (Université de Rennes I)
François Boulier (Université de Lille)
Laurent Busé (INRIA Sophia Antipolis)
Frédéric Chyzak (NRIA Saclay)
Jean-Guillaume Dumas (Université Grenoble Alpes)
Jean-Charles Faugère (INRIA Rocquencourt)
Joris Van der Hoeven (CNRS, École polytechnique)
Claude-Pierre Jeannerod (INRIA, ENS Lyon)
Emmanuel Thomé (INRIA Nancy-Loria)
Jean-Claude Yakoubsohn (Université Toulouse III)

Organizing Committee

Nicolas Brisebarre (ENS Lyon)
Carole El Bacha (Université Libanaise, Fanar)
Pascal Giorgi (Université de Montpellier)
Marc Mezzarobba (Université Pierre et Marie Curie)
Guillaume Moroz (INRIA Nancy Grand Est)
​
​
Courses

• Valérie Berthé (Université Paris Diderot)

Symbolic dynamical systems and representations (notes)  (slides)

• Alin Bostan (SpecFun, INRIA Saclay)   (detailed summary)

Computer Algebra for Lattice Path Combinatorics   (part. 1)   (part. 2)   (part. 3)

• Peter Bürgisser (Technische Universität Berlin)

Condition. The Geometry of Numerical Algorithms (part. 1)   (part. 2)   (vidéos)

• Xavier Caruso (IRMAR Université de Rennes 1)

Calcul sur ordinateur avec les nombres p-adiques   (slides)   (notes)