Formalization of a sign determination algorithm in real algebraic geometry - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2021

Formalization of a sign determination algorithm in real algebraic geometry

Abstract

One of the problems in real algebraic geometry is root counting. Given a polynomial, we want to count the number of roots that satisfies constraints expressed as polynomial inequalities, this is done through a process called "sign determination". A naive way is to compute an exponential number of time consuming quantities, called Tarski Queries. In this paper, we formalize the construction of the adapted matrix part of the "better sign determination" algorithm from "Algorithms in Real Algebraic Geometry" (Basu, Pollack, Roy). We prove in Coq that the matrix has the properties expected from the book: small size but still invertible.
Fichier principal
Vignette du fichier
main.pdf (117.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03274013 , version 1 (29-06-2021)

Identifiers

  • HAL Id : hal-03274013 , version 1

Cite

Cyril Cohen. Formalization of a sign determination algorithm in real algebraic geometry. 2021. ⟨hal-03274013⟩
66 View
116 Download

Share

Gmail Facebook X LinkedIn More