Nowadays, it is well-known that also long-standing open problems in Algebraic Geometry can benefit of algorithmic methods that are developed by Computer Algebra.

The first obvious reason is that algorithms allow the construction of examples, from which researchers can deduce possible solutions to the questions they deal with. In this context, the necessity to design new algorithms for specific topics of interest or to optimize the existing ones often arises. Indeed, several existing algorithms theoretically allow some explicit computations (e.g. Groebner Bases) but in practice they do not give the desired result in a reasonable time, or using a reasonable amount of memory.

The second less obvious reason is that the designing of an algorithm can give a new insight in the problem one is trying to solve, giving in particular the chance to prove a statement in a constructive way, but also highlighting new features that could not be seen with an existential approach.

As a consequence of the two above points, investigations in Algebraic Geometry from a computational point of view can also provide applications in other fields (e.g. coding theory, cryptography, computer graphics, data clouds).

This session aims at gathering specialists from different areas (Algebraic Geometry, Computer Algebra, Applied Mathematics) and discuss interactions between them.

Talks should focus on

• algebraic and combinatorial aspects of problems in Algebraic Geometry ;
• algorithms and constructive methods for Algebraic Geometry and applications;
• implementation of algorithms and optimization, possibly with comparisons with existing ones.