General information
The annual conference Polynomial Computer Algebra is devoted to polynomial algorithms in Computer Algebra. This field has a lot of applications both in theoretical and applied mathematics as well as in Computer Science. The conference PCA'2025 is the 18th in the series.
The conference is supported by Leonhard Euler International Mathematical Institute at St. Petersburg. Grant №075–15–2025–343, №075–15–2025–34
Topics of interest for PCA'2025 include but are not restricted to:
- Gröbner bases
- Combinatorics of monomial orderings
- Differential Gröbner bases
- D-modules
- Polynomial differential operators
- Involutive algorithms
- Computational algebraic geometry
- Computational group theory
- Computational topology
- Parallelization of algorithms
- Algorithms of tropical mathematics
- Quantum computing
- Cryptography
- Tropical manifolds
- Matrix algorithms
- Complexity of algorithms
We plan five or six working days, each day containing two plenary talks and 5-7 contributed talks.
We plan an excursion and other cultural events like musical concert. The conference dinner will be on October 2.
