Symbolic Computation with Symmetric Polynomials in Real Algebraic Geometry
Cordian Riener, Thi Xuan Vu

TL;DR
This paper reviews recent advances in symbolic computation that exploit symmetry, particularly permutation symmetry, to enhance efficiency and understanding in real algebraic geometry.
Contribution
It provides a comprehensive survey of methods leveraging permutation symmetry to improve symbolic polynomial computations in real algebraic geometry.
Findings
Symmetry reduces computational complexity in polynomial systems.
Permutation symmetry enhances algorithmic efficiency.
Structural insights are gained through symmetry exploitation.
Abstract
Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity, improve algorithmic efficiency, and reveal deeper structural insights. The main focus is on symmetry by the permutation of variables.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Combinatorial Mathematics · Coding theory and cryptography
