This is a series of anual events following those organized in Bari 2025, and La Rioja 2024.

The goal of these meetings is to bring together researchers working on alternative methods for solving polynomial systems. While Gröbner bases have been highly influential, Buchberger’s algorithm can be computationally heavy when used by default. Gröbner-free approaches instead rely on linear algebra and combinatorics to obtain the same results more efficiently, reserving Gröbner basis computations for when they are truly needed.

Topics include but are not limited to

* Combinatorial methods for monomial and polynomial ideals
* Improvements and generalizations of Gröbner-related algorithms such as Janet’s and Macaulay’s.
* Algorithms for doing computations in subalgebras • 0-dimensional solving and bonding problems
* Applications in coding theory, cryptography, reverse engineering, biology, and algebraic statistics

As in the previous editions, our timing will be sufficiently relaxed to allow participants to discuss and work together.