The annual conference Polynomial Computer Algebra will be devoted to polynomial algorithms of
modern computer algebra. This field has a lot of applications both in theoretical and applied mathematics
and also in computer science. The conference topics will include but not restricted to: Gröbner bases,
combinatorics of monomial orderings,сomputational Differential Algebra, D-modules, Involutive
algorithms, сomputational algebraic geometry, сomputational group theory, parallelization of algorithms,
algorithms of tropical mathematics, quantum computing, cryptography, matrix algorithms, complexity of
computer algebra algorithms, quantum algorithms of computer algebra
The PCA2025 conference will be the 19th in this series. Many of the leading experts in the field such as
B. Buhberger, S. Watt, D. Grigoriev, S. Chen, L. Robbiano, J.C. Faugère, V. Gerdt, M. Kreuzer, E. Mayr,
E.Zima, E.Mayr and others took part in previous PCA conferences. The very last PCA conferences were
held in a hybrid format. We expect to hold the 2025 conference mainly in person format, possibly with the
inclusion of a few number of remote talks. So, we plan to attract key participants of previous conferences
this time either in person or remote. We also plan to organize traditional free round table discussion
devoted to modern problems of polynomial computer algebra and applications.
Tentative list of speakers:Stephen Watt , Lorenzo Robbiano, Alexandr Tiskin, Vladimir Kornyak, Dima
Grigoriev, Mark Spivakovsky, Shaoshi Chen, David Jeffrey, Teo Mora, Askold Khovansky, Ernst Mayr,
Chengui Mou, Sergey Gutnik, Eugene Zima, Changbo Chen, Frédéric Chyzak, Thomas Sturm, Mark
Gizbrecht, Victor Pan, Ilias Cotsireas