On Projective Delineability
arXiv:2411.13300 · doi:10.1109/SYNASC65383.2024.00015
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.
Accepted for publication in the Proceedings of the 26th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2024)