Computing critical points for invariant algebraic systems

DOI10.1016/J.JSC.2022.10.002zbMath1499.14096arXiv2009.00847OpenAlexW3081736912MaRDI QIDQ2100065

Mohab Safey El Din, Jean-Charles Faugère, Thi Xuan Vu, Éric Schost, George Labahn

Publication date: 21 November 2022

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.00847

zbMATH Keywords

computational complexitycritical pointsdeterminantal systemsinvariant algebraic systemspolynomial systems solving

Mathematics Subject Classification ID

Computational aspects of higher-dimensional varieties (14Q15) Actions of groups on commutative rings; invariant theory (13A50)

Related Items (3)

Faster real root decision algorithm for symmetric polynomials ⋮ The poset of Specht ideals for hyperoctahedral groups ⋮ Linear slices of hyperbolic polynomials and positivity of symmetric polynomial functions

Uses Software

• Unnamed Item
• Unnamed Item
• ISOLATE
• Bertini_real

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symmetric semi-algebraic sets and non-negativity of symmetric polynomials
• Bounding the equivariant Betti numbers of symmetric semi-algebraic sets
• Gröbner bases of symmetric ideals
• Computing isolated roots of sparse polynomial systems in affine space
• On the degree and half-degree principle for symmetric polynomials
• A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
• A baby step-giant step roadmap algorithm for general algebraic sets
• Polynomial equation solving by lifting procedures for ramified fibers
• Deformation techniques for sparse systems
• Solving zero-dimensional systems through the rational univariate representation
• Solving a system of algebraic equations with symmetries
• Straight-line programs in geometric elimination theory
• On the positivity of symmetric polynomial functions. I: General results
• Computational invariant theory
• Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
• Real solving for positive dimensional systems.
• On the complexity of computing with zero-dimensional triangular sets
• Affine solution sets of sparse polynomial systems
• Numerically computing real points on algebraic sets
• Deformation techniques for efficient polynomial equation solving.
• Homotopy techniques for solving sparse column support determinantal polynomial systems
• Invariant algebraic sets and symmetrization of polynomial systems
• Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations
• Solving determinantal systems using homotopy techniques
• Elimination for generic sparse polynomial systems
• Intrinsic complexity estimates in polynomial optimization
• On the geometry of polar varieties
• Cell decomposition of almost smooth real algebraic surfaces
• The membrane inclusions curvature equations
• Minimizing polynomials via sum of squares over the gradient ideal
• Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
• Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
• On the Complexity of Computing Critical Points with Gröbner Bases
• Global optimization of polynomials using generalized critical values and sums of squares
• A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
• Ideals defined by matrices and a certain complex associated with them
• Algorithm 976
• Real Root Finding for Equivariant Semi-algebraic Systems
• Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
• Algebraic Degree of Polynomial Optimization
• Critical points and Gröbner bases
• Solving polynomial systems globally invariant under an action of the symmetric group and application to the equilibria of N vortices in the plane
• Computation of invariants of finite abelian groups
• FGb: A Library for Computing Gröbner Bases
• Algorithms in invariant theory
• Algorithms in real algebraic geometry
• A Gröbner free alternative for polynomial system solving
• Resultant of an equivariant polynomial system with respect to the symmetric group

This page was built for publication: Computing critical points for invariant algebraic systems