Real root finding for equivariant semi-algebraic systems

Abstract : Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a semi-algebraic set is invariant by the action of the symmetric group. We show that such a set is either empty or it contains a point with at most $2d-1$ distinct coordinates. Combining this geometric result with efficient algorithms for real root finding (based on the critical point method), one can decide the emptiness of basic semi-algebraic sets defined by $s$ polynomials of degree $d$ in time $(sn)^{O(d)}$. This improves the state-of-the-art which is exponential in $n$. When the variables $x_1, \ldots, x_n$ are quantified and the coefficients of the input system depend on parameters $y_1, \ldots, y_t$, one also demonstrates that the corresponding one-block quantifier elimination problem can be solved in time $(sn)^{O(dt)}$.
Complete list of metadatas

Cited literature [47 references]  Display  Hide  Download

https://hal.inria.fr/hal-01819106
Contributor : Mohab Safey El Din <>
Submitted on : Wednesday, June 20, 2018 - 8:59:20 AM
Last modification on : Friday, July 5, 2019 - 3:26:03 PM
Long-term archiving on : Tuesday, September 25, 2018 - 9:24:11 AM

Files

rie-sa-18.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01819106, version 1
  • ARXIV : 1806.08121

Citation

Cordian Riener, Mohab Safey El Din. Real root finding for equivariant semi-algebraic systems. ISSAC 20018 - 43rd International Symposium on Symbolic and Algebraic Computation, Jul 2018, New-York, United States. ⟨hal-01819106⟩

Share

Metrics

Record views

134

Files downloads

129