PhD Seminar • Symbolic Computation | Cryptography • Bit Size Estimates for Computing Roadmaps in Smooth Bounded Real Hypersurfaces

Please note: This PhD seminar will take place in DC 2306.

Jesse Allister Kasian Elliott, PhD candidate
David R. Cheriton School of Computer Science

Supervisors: Professors David Jao, Éric Schost

We give bit size estimates for computing roadmaps in smooth bounded real hypersurfaces. Roadmaps are used to decide if two points in a real algebraic set are continuously connected by a path from one point to the other, and therefore have applications in robot motion planning by deciding if paths exist between points.

To obtain our height estimates, we apply tools from intersection theory that involve the arithmetic Chow ring, developed by D’Andrea, Krick, and Sombra.