On Projective Delineability

International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 9–16

Abstract

We consider cylindrical algebraic decomposition (CAD) and the key concept of delineability which underpins CAD theory. We introduce the novel concept of projective delineability which is easier to guarantee computationally. We prove results about this which can allow reduced CAD computations.

Authors 8

1. Lucas Michel

   University of Liège

   Affiliation as printed

   University of Liège

2. Jasper Nalbach Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University

3. Pierre Mathonet

   University of Liège

   Affiliation as printed

   University of Liège

4. Naïm Zénaïdi

   University of Liège

   Affiliation as printed

   University of Liège

5. Christopher W. Brown

   United States Naval Academy

   Affiliation as printed

   United States Naval Academy

6. Erika Ábrahám Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University

7. James H. Davenport

   University of Bath

   Affiliation as printed

   University of Bath

8. Matthew England

   Coventry University

   Affiliation as printed

   Coventry University