General informationSome restrictions imposed in connection with the coronavirus pandemic in Russia and in St. Petersburg have been lifted very recently. So, the current situation in Saint Petersburg allows us to organize a conference in a so-called combined format. Limited number of participants who can be present at this time in Saint Petersburg will be able to participate in the usual format in person. Those participants who cannot visit Saint Petersburg have the opportunity to participate in the conference in a remote format. Zoom sessions will be organized and all registered participants will receive information about the zoom channel of the PCA2021 conference. We will also provide more information about the new PCA conference rules on the conference website. We will also inform all potential participants about the current state of restrictions related to the COVID19 epidemic at the conference venue.
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'2021 is the 14-th in the series. This year PCA Conference is devoted to the memory of Vladimir Gerdt who has passed away January 5, 2021. He was a brilliant specialist in the field of computer algebra and one of the founders of this series of conferences. For many years from 2008 he was a PC member and one of the key participant of all previous PCA conferences. We plan to have a special memorial session devoted to his memory at Tuesday April 20 both in Euler Institute and in Zoom format.
Topics of interest for PCA2021 include but are not restricted to:
- Gröbner bases
- Combinatorics of monomial orderings
- Differential Gröbner bases
- Polynomial differential operators
- Involutive algorithms
- Computational algebraic geometry
- Computational group theory
- Computational topology
- Parallelization of algorithms
- Algorithms of tropical mathematics
- Quantum computing
- 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.