On some Exotic Cylindrical Algebraic Decompositions and Cells
By: Lucas Michel
Cylindrical Algebraic Decompositions (CADs) endowed with additional topological properties have found applications beyond their original logical setting, including algorithmic optimizations in CAD construction, robot motion planning, and the algorithmic study of the topology of semi-algebraic sets. In this paper, we construct explicit examples of CADs and CAD cells that refute several conjectures and open questions of J. H. Davenport, A. Locatelli, and G. K. Sankaran concerning these topological assumptions.
Similar Papers
Projective Delineability for Single Cell Construction
Symbolic Computation
Makes math problems with real numbers easier to solve.
A Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination
Symbolic Computation
Solves hard math problems faster for computers.
A Divide and Conquer Algorithm for Deciding Group Cellular Automata Dynamics
Formal Languages and Automata Theory
Simplifies complex computer programs for easier study.